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;
public class Main{

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		char []s = sc.next().toCharArray();
		char []t = sc.next().toCharArray();
		
		int []c1 = new int [26 +'a'];
		int []c2 = new int [26 +'a'];
		
		for(int i = 'a' ; i < 26 +'a' ;i++) {
			c1[i] = -1;
			c2[i] = -1;
		}
		
		int n = s.length;
		int m = t.length;
		
		for(int i = 0 ; i < n ;i++) {
			c1[s[i]]++;
		}
		
		for(int i = 0 ; i < m ;i++) {
			c2[t[i]]++;
		}
		
		Arrays.sort(c1);
		Arrays.sort(c2);
		
		boolean flag = true;
		for(int i = 'a' ; i < 'a' + 26 ; i++) {
			if(c1[i] != c2[i]) {
				flag = false;
				break;
			}
		}
		
		if(flag) {
			System.out.println("Yes");
		}
		else {
			System.out.println("No");
		}
		
		
	}

}
