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.Integer.*;
import static java.lang.Long.*;
import static java.lang.Math.*;
import static java.lang.System.*;

public class Main {
	public static void main(String[] args) {
		int i,j;
		Scanner sc = new Scanner(in);
		String s = sc.next();
		String t = sc.next();
		sc.close();
		boolean f = true;
		HashMap<Character, Character> c1 = new HashMap<>();
		HashMap<Character, Character> c2 = new HashMap<>();
		for(i=0;i<s.length();i++) {
			if(c1.containsKey(s.charAt(i))) {
				if(!c1.get(s.charAt(i)).equals(t.charAt(i))) {
					f = false;
					break;
				}
			} else {
				c1.put(s.charAt(i), t.charAt(i));
			}
			if(c2.containsKey(t.charAt(i))) {
				if(!c2.get(t.charAt(i)).equals(s.charAt(i))) {
					f = false;
					break;
				}
			} else {
				c2.put(t.charAt(i), s.charAt(i));
			}
		}
		out.println(f?"Yes":"No");
	}
}
