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.*;

public class Main {

	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		String qLine = scanner.nextLine();
		String aLine = scanner.nextLine();
		
		int[] map = new int['z' - 'a' + 1];
		int[] remap = new int['z' - 'a' + 1];
		
		for(int i = 0;i<26;i++) {
			map[i]= -1;
			remap[i]= -1; 
		}
		
		for(int i = 0;i<qLine.length();i++) {
			if(map[qLine.charAt(i) - 'a'] < 0) {
				map[qLine.charAt(i) - 'a'] = aLine.charAt(i) - 'a';
			}else {
				if(map[qLine.charAt(i) - 'a'] != aLine.charAt(i) - 'a') {
					System.out.println("No");
					return;
				}
			}
			if(remap[aLine.charAt(i) - 'a'] < 0) {
				remap[aLine.charAt(i) - 'a'] = qLine.charAt(i) - 'a';
			}else {
				if(remap[aLine.charAt(i) - 'a'] != qLine.charAt(i) - 'a') {
					System.out.println("No");
					return;
				}
			}
		}
		System.out.println("Yes");
    }
}
    
