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 sc = new Scanner(System.in);
		String s = sc.next();
		String t = sc.next();
		String s1 = replace(s);
		String t1 = replace(t);
		if (s1.equals(t1)) {
			System.out.println("Yes");
		} else {
			System.out.println("No");
		}
	}
	
	public static String replace(String str) {
		char count = 0;
		StringBuilder sb = new StringBuilder();
		HashMap<Character, Character> map = new HashMap<Character, Character>();
		for (int i = 0; i < str.length(); i++) {
			Character ct = map.get(str.charAt(i));
			if (ct == null) {
				map.put(str.charAt(i), (char) ('A' + count));
				ct = (char) ('A' + count);
				count++;
			}
			sb.append(ct);
		}
		return sb.toString();		
		
	}
}