CF1111A.Superhero Transformation

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

We all know that a superhero can transform to certain other superheroes. But not all Superheroes can transform to any other superhero. A superhero with name $s$ can transform to another superhero with name $t$ if $s$ can be made equal to $t$ by changing any vowel in $s$ to any other vowel and any consonant in $s$ to any other consonant. Multiple changes can be made.

In this problem, we consider the letters 'a', 'e', 'i', 'o' and 'u' to be vowels and all the other letters to be consonants.

Given the names of two superheroes, determine if the superhero with name $s$ can be transformed to the Superhero with name $t$ .

输入格式

The first line contains the string $s$ having length between $1$ and $1000$ , inclusive.

The second line contains the string $t$ having length between $1$ and $1000$ , inclusive.

Both strings $s$ and $t$ are guaranteed to be different and consist of lowercase English letters only.

输出格式

Output "Yes" (without quotes) if the superhero with name $s$ can be transformed to the superhero with name $t$ and "No" (without quotes) otherwise.

You can print each letter in any case (upper or lower).

输入输出样例

输入#1
```
a
u
```
输出#1
```
Yes
```
输入#2
```
abc
ukm
```
输出#2
```
Yes
```
输入#3
```
akm
ua
```
输出#3
```
No
```

说明/提示

In the first sample, since both 'a' and 'u' are vowels, it is possible to convert string $s$ to $t$ .

In the third sample, 'k' is a consonant, whereas 'a' is a vowel, so it is not possible to convert string $s$ to $t$ .

首页