题目描述

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 $\tt{a}$, $\tt{e}$, $\tt{i}$, $\tt{o}$, $\tt{u}$, and $\tt{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 $\textit{short}$ name and the $\textit{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).

输入格式

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.

输出格式

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

Shrm-el-Shikh
Sharm-el-Sheikh

Same

Eilot
Eilat

Different

Saint-Petersburg
Saint-Petersburg

Same

Bcdfghjklmnpqrstvwxz
Abcdefghijklmnopqrstuvwxzyy

Same

Aa
aaaA

Same

Etis-Atis-Amatis
Etis-Atis-Animatis

Different

will-the-wisp
will-o-the-wisp

Different

--a-very-short-name--
long-name

Different