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.Arrays;
import java.util.Scanner;

class Main{
	public static void main(String args[]){
		Scanner sc=new Scanner(System.in);
		int[] cntS = new int['z' - 'a' + 1];
		int[] cntT = new int['z' - 'a' + 1];
		String S = sc.next(), T = sc.next();

		for(int i = 0; i < S.length(); i++) cntS[S.charAt(i) - 'a']++;
		for(int i = 0; i < T.length(); i++) cntT[T.charAt(i) - 'a']++;
		Arrays.sort(cntS); Arrays.sort(cntT);
		boolean flg = true;

		for(int i = 0; i < cntS.length; i++) {
			if(cntS[i] != cntT[i]) flg = false;
		}
		System.out.println(flg ? "Yes" : "No");
	}
}