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.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;

class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String s = sc.next();
		String t = sc.next();
		Map<String, Integer> smap = new HashMap<>();
		Map<String, Integer> tmap = new HashMap<>();

		for (int i = 0; i < s.length(); i++) {
			if (smap.containsKey(String.valueOf(s.charAt(i)))) {
				smap.put(String.valueOf(s.charAt(i)), (smap.get(String.valueOf(s.charAt(i)))+1));
			} else {
				smap.put(String.valueOf(s.charAt(i)), 1);
			}
		}
		for (int i = 0; i < t.length(); i++) {
			if (tmap.containsKey(String.valueOf(t.charAt(i)))) {
				tmap.put(String.valueOf(t.charAt(i)), (tmap.get(String.valueOf(t.charAt(i)))+1));
			} else {
				tmap.put(String.valueOf(t.charAt(i)), 1);
			}
		}
		if (smap.size() != tmap.size()) {
			System.out.println("No");
			return;
		}
		List<String> slist = new ArrayList<>(smap.keySet());
		List<String> tlist = new ArrayList<>(tmap.keySet());
		List<Integer> stemp = new ArrayList<>();
		List<Integer> ttemp = new ArrayList<>();
		for (int i = 0; i < slist.size(); i++) {
			stemp.add(smap.get(slist.get(i)));
			ttemp.add(tmap.get(tlist.get(i)));
		}
		Collections.sort(stemp);
		Collections.sort(ttemp);
		if (!stemp.equals(ttemp)) {
			System.out.println("No");
			return;
		}
		System.out.println("Yes");
	}
}
