s=input()
t=input()
vowel="aeiou"
flag=0
if(len(s)==len(t)):
for i in range(len(s)):
x=vowel.find(s[i])
y=vowel.find(t[i])
if((x == -1 and y == -1) or (x>=0 and y>=0)):
flag=1
continue
else:
flag=0
break
if(flag==0):
print("NO")
else:
print("YES")#include<iostream>
#include<cstring>
using namespace std;
int vowel(char c)
{
switch(c)
{
case 'a':
case 'e':
case 'i':
case 'o':
case 'u':
{
return 1;
break;
}
default:
{
return 0;
break;
}
}
}
int main()
{
char s[1005],t[1005];
bool flag=true;
cin>>s>>t;
if(strlen(s)!=strlen(t))
{
cout<<"No";
}
else
{
for(int i=0;i<(int)strlen(s);i++)
{
if(vowel(s[i])!=vowel(t[i]))
{
flag=false;
break;
}
}
if(flag)
{
cout<<"Yes";
}
else
{
cout<<"No";
}
}
return 0;
}
1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |