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.List;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String b = sc.nextLine();
		String a = sc.nextLine();
		
		char[] before = b.toCharArray();
		char[] after = a.toCharArray();
		
		String ans = "Yes";
		for (int i=0; i<before.length; i++) {
			if (!changeChar(before, after, i)) {
				ans = "No";
				break;
			}
		}

		System.out.println(ans);
	}
	
	private static boolean changeChar(char[] before, char[] after, int index) {
		char b = before[index];
		char a = after[index];

		if (b == a) {
			return true;
		}

		for (int i=0; i<before.length; i++) {
			if (before[i] == b) {
				before[i] = a;
			} else if (before[i] == a) {
				before[i] = b;
			} else {
				continue;
			}
			if (i < index) {
				return false;
			}
		}
		return true;
	}
}