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.*;
import static java.lang.Math.*;
import java.math.BigInteger;

public class Main {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		
		// 入力
		String s = sc.next();
		String t = sc.next();

		// 計算
		String result = "Yes";
		int[] arrayS = new int[26];
		int[] arrayT = new int[26];
		int index = 0;
		for(char c = 'a'; c <= 'z'; c++){
		    for(int i = 0; i < s.length(); i++){
		        if(s.charAt(i) == c) arrayS[index]++;
		        if(t.charAt(i) == c) arrayT[index]++;
		    }
		    index++;
		}
		Arrays.sort(arrayS);
		Arrays.sort(arrayT);
		for(int i = 0; i < 26; i++){
		    if(arrayS[i] != arrayT[i]) result = "No";
		}
		
		// 出力
		System.out.println(result);
		
	}
}
