You are given strings S and T consisting of lowercase English letters.

You can perform the following operation on S any number of times:

Operation: Choose two distinct lowercase English letters c_1 and c_2, then replace every occurrence of c_1 with c_2, and every occurrence of c_2 with c_1.

Determine if S and T can be made equal by performing the operation zero or more times.

Constraints

* 1 \leq |S| \leq 2 \times 10^5
* |S| = |T|
* S and T consists of lowercase English letters.

Input

Input is given from Standard Input in the following format:


S
T


Output

If S and T can be made equal, print `Yes`; otherwise, print `No`.

Examples

Input

azzel
apple


Output

Yes


Input

chokudai
redcoder


Output

No


Input

abcdefghijklmnopqrstuvwxyz
ibyhqfrekavclxjstdwgpzmonu


Output

Yes
import java.util.Scanner;
import java.util.TreeMap;
public class Main {
//One to One Correspondence
//Every single char in S has to correspond with every single char in T
//Every single char in T has to correspond with every single char in S
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String S = sc.next();
		String T = sc.next();
		int N = S.length();
		TreeMap<Character, Character> StoT = new TreeMap<>();
		TreeMap<Character, Character> TtoS = new TreeMap<>();
		for (int i=0; i<N; i++){
			if (StoT.containsKey(S.charAt(i)) && (StoT.get(S.charAt(i)) != T.charAt(i))){
				System.out.println("No");
				System.exit(0);
			}
			if (TtoS.containsKey(T.charAt(i)) && (TtoS.get(T.charAt(i)) != S.charAt(i))){
				System.out.println("No");
				System.exit(0);
			}
			StoT.put(S.charAt(i), T.charAt(i));
			TtoS.put(T.charAt(i), S.charAt(i));
		}
		System.out.println("Yes");
		
	}

}