M. Missing Vowels
time limit per test
2 seconds
memory limit per test
1024 megabytes
input
standard input
output
standard output

There are many ways to write a word on paper. For example, some writing systems, like Arabic and Hebrew, omit most vowels, although they write some of them.

In this problem, we will only consider strings consisting of English letters and hyphens. Letters 'a', 'e', 'i', 'o', 'u', and 'y' are considered to be vowels, while hyphens and all other letters are considered to be consonants. All comparisons are case-insensitive: uppercase and lowercase versions of the same letter are considered equal.

You are given two strings $$$s$$$ and $$$f$$$, called the short name and the full name, respectively. Your task is to check whether the short name $$$s$$$ can be obtained from the full name $$$f$$$ by omitting some vowels (possibly none).

Input

The first line contains a single string $$$s$$$, denoting the short name.

The second line contains a single string $$$f$$$, denoting the full name.

Each string is non-empty and consists of at most $$$1000$$$ English letters and hyphens.

Output

Print "Same" if the short name $$$s$$$ can be obtained from the long name $$$f$$$ by omitting some vowels, and "Different" otherwise.

Examples
Input
Shrm-el-Shikh
Sharm-el-Sheikh
Output
Same
Input
Eilot
Eilat
Output
Different
Input
Saint-Petersburg
Saint-Petersburg
Output
Same
Input
Bcdfghjklmnpqrstvwxz
Abcdefghijklmnopqrstuvwxzyy
Output
Same
Input
Aa
aaaA
Output
Same
Input
Etis-Atis-Amatis
Etis-Atis-Animatis
Output
Different
Input
will-the-wisp
will-o-the-wisp
Output
Different
Input
--a-very-short-name--
long-name
Output
Different