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.

Input

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

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).

Examples

Input


a
u


Output


Yes


Input


abc
ukm


Output


Yes


Input


akm
ua


Output


No

Note

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.
import java.io.*;
import java.util.Iterator;
import java.util.Set;
import java.util.StringTokenizer;
import java.util.TreeSet;
import java.util.function.Function;


public class A_537
{
	private static BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
	private static StringTokenizer stringTokenizer = null;
	private static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));


	public static void add(int delta, int[] result)
	{
		for (int index = 0; index < result.length; index++)
		{
			result[index] += delta;
		}
	}


	public static void add(int delta, int[]... result)
	{
		for (int index = 0; index < result.length; index++)
		{
			add(delta, result[index]);
		}
	}


	public static int binarySearchMaximum(Function<Integer, Boolean> filter, int start, int end)
	{
		return -binarySearchMinimum(x -> filter.apply(-x), -end, -start);
	}


	public static int binarySearchMinimum(Function<Integer, Boolean> filter, int start, int end)
	{
		int result;
		if (start == end)
		{
			result = end;
		}
		else
		{
			int middle = start + (end - start) / 2;
			if (filter.apply(middle))
			{
				result = binarySearchMinimum(filter, start, middle);
			}
			else
			{
				result = binarySearchMinimum(filter, middle + 1, end);
			}
		}
		return result;
	}


	public static void close()
	{
		out.close();
	}


	static long gcd(long a, long b)
	{
		return b == 0 ? a : gcd(b, a % b);
	}


	public static long lcm(int a, int b)
	{
		return a * b / gcd(a, b);
	}


	public static void main(String[] args)
	{
		try
		{
			solve();
		}
		catch (IOException exception)
		{
			exception.printStackTrace();
		}
		close();
	}


	public static double nextDouble()
		throws IOException
	{
		return Double.parseDouble(nextString());
	}


	public static int nextInt()
		throws IOException
	{
		return Integer.parseInt(nextString());
	}


	public static void nextInts(int n, int[]... result)
		throws IOException
	{
		for (int index = 0; index < n; index++)
		{
			for (int value = 0; value < result.length; value++)
			{
				result[value][index] = nextInt();
			}
		}
	}


	public static int[] nextInts(int n)
		throws IOException
	{
		int[] result = new int[n];
		nextInts(n, result);
		return result;
	}


	public static String nextLine()
		throws IOException
	{
		return bufferedReader.readLine();
	}


	public static long nextLong()
		throws IOException
	{
		return Long.parseLong(nextString());
	}


	public static void nextLongs(int n, long[]... result)
		throws IOException
	{
		for (int index = 0; index < n; index++)
		{
			for (int value = 0; value < result.length; value++)
			{
				result[value][index] = nextLong();
			}
		}
	}


	public static long[] nextLongs(int n)
		throws IOException
	{
		long[] result = new long[n];
		nextLongs(n, result);
		return result;
	}


	public static String nextString()
		throws IOException
	{
		while ((stringTokenizer == null) || (!stringTokenizer.hasMoreTokens()))
		{
			stringTokenizer = new StringTokenizer(bufferedReader.readLine());
		}
		return stringTokenizer.nextToken();
	}


	public static String[] nextStrings(int n)
		throws IOException
	{
		String[] result = new String[n];
		{
			for (int index = 0; index < n; index++)
			{
				result[index] = nextString();
			}
		}
		return result;
	}


	public static <Type> String toString(Iterator<Type> iterator, String separator)
	{
		StringBuilder stringBuilder = new StringBuilder();
		if (iterator.hasNext())
		{
			stringBuilder.append(iterator.next());
		}
		while (iterator.hasNext())
		{
			stringBuilder.append(separator);
			stringBuilder.append(iterator.next());
		}
		return stringBuilder.toString();
	}


	public static <Type> String toString(Iterator<Type> iterator)
	{
		return toString(iterator, " ");
	}


	public static <Type> String toString(Iterable<Type> iterable, String separator)
	{
		return toString(iterable.iterator(), separator);
	}


	public static <Type> String toString(Iterable<Type> iterable)
	{
		return toString(iterable, " ");
	}


	public static final Set<Character> VOWELS = new TreeSet<>();


	public static boolean isVowel(char character)
	{
		return VOWELS.contains(character);
	}


	public static boolean trans(String s, String t)
	{
		boolean result = s.length() == t.length();
		if (result)
		{
			for (int index = 0; index < s.length(); index++)
			{
				result &= isVowel(s.charAt(index)) == isVowel(t.charAt(index));
			}
		}
		return result;
	}


	public static void solve()
		throws IOException
	{
		VOWELS.add('a');
		VOWELS.add('e');
		VOWELS.add('i');
		VOWELS.add('o');
		VOWELS.add('u');
		String s = nextString();
		String t = nextString();
		out.println(trans(s, t) ? "Yes" : "No");
	}
}