Problem: 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.

Solution (in JAVA):

Solution:

import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.util.*;
import java.math.*;

import org.omg.CORBA.Any;


public class template {

	public static void main(String[] args) throws IOException {
		Scanner scn=new Scanner(System.in);
		String s=scn.next();
		String t=scn.next();
		
		if(s.length() != t.length()){
			System.out.println("No");
			return ;
		}
		
		else{
			for(int i=0; i<s.length(); i++){
				
				  if(f(s.charAt(i)) != f(t.charAt(i))){
					  System.out.println("No");
					  return;
				  }
			}
		}
		
		System.out.println("Yes");
	}
	
	






	// _________________________TEMPLATE_____________________________________________________________

	








	private static boolean f(char ch) {
		if(ch=='a' || ch =='e'|| ch=='i' || ch=='o' || ch=='u')
			return true;
		else
			return false;
	}








	private static class pair implements Comparable<pair> {
		int p;
		int t;

		pair(int l, int b) {
			p = l;
			t = b;
		}

		@Override
		public int compareTo(pair o) {
			
			 if(this.p==o.p)
				 return this.t-o.t;
			 else
				 return o.p-this.p;
		}

		public String toString() {
			return p + "-" + t;
		}
	}

	public static void printarray(long[] dp1) {
		for (long i : dp1)
			System.out.print(i + " ");
		System.out.println();
	}
	
	public static void inputarray(long []a, int n,Reader scn) throws IOException{
		for(int i=0; i<n; i++)
			a[i]=scn.nextLong();
	}

	private static class Reader {
		final private int BUFFER_SIZE = 1 << 16;
		private DataInputStream din;
		private byte[] buffer;
		private int bufferPointer, bytesRead;

		public Reader() {
			din = new DataInputStream(System.in);
			buffer = new byte[BUFFER_SIZE];
			bufferPointer = bytesRead = 0;
		}

		public Reader(String file_name) throws IOException {
			din = new DataInputStream(new FileInputStream(file_name));
			buffer = new byte[BUFFER_SIZE];
			bufferPointer = bytesRead = 0;
		}

		public String readLine() throws IOException {
			byte[] buf = new byte[100000 + 1]; // line length
			int cnt = 0, c;
			while ((c = read()) != -1) {
				if (c == '\n')
					break;
				buf[cnt++] = (byte) c;
			}
			return new String(buf, 0, cnt);
		}

		public int nextInt() throws IOException {
			int ret = 0;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');

			if (neg)
				return -ret;
			return ret;
		}

		public long nextLong() throws IOException {
			long ret = 0;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');
			if (neg)
				return -ret;
			return ret;
		}

		public double nextDouble() throws IOException {
			double ret = 0, div = 1;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();

			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');

			if (c == '.') {
				while ((c = read()) >= '0' && c <= '9') {
					ret += (c - '0') / (div *= 10);
				}
			}

			if (neg)
				return -ret;
			return ret;
		}

		private void fillBuffer() throws IOException {
			bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
			if (bytesRead == -1)
				buffer[0] = -1;
		}

		private byte read() throws IOException {
			if (bufferPointer == bytesRead)
				fillBuffer();
			return buffer[bufferPointer++];
		}

		public void close() throws IOException {
			if (din == null)
				return;
			din.close();
		}
	}

}