Problem:
Score : 300 points

Problem Statement

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.

Sample Input 1

azzel
apple

Sample Output 1

Yes

azzel can be changed to apple, as follows:

Choose e as c_1 and l as c_2. azzel becomes azzle.

Choose z as c_1 and p as c_2. azzle becomes apple.

Sample Input 2

chokudai
redcoder

Sample Output 2

No

No sequences of operation can change chokudai to redcoder.

Sample Input 3

abcdefghijklmnopqrstuvwxyz
ibyhqfrekavclxjstdwgpzmonu

Sample Output 3

Yes

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Time Limit Exceeded)

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 sArray[] = new String[s.length()];
		String tArray[] = new String[t.length()];
		for(int i = 0; i < s.length(); i++) {
			sArray[i] = String.valueOf(s.charAt(i));
			tArray[i] = String.valueOf(t.charAt(i));
			for(int j = 0; j < i; j++) {
				if(sArray[j].equals(sArray[i])) {
					sArray[i] = "";
				}
				if(tArray[j].equals(tArray[i])) {
					tArray[i] = "";
				}
			}
		}
			for(int i = 0; i < s.length(); i++) {
				if((sArray[i].equals("") || tArray[i].equals("")) && !(sArray[i].equals(tArray[i]))) {
					System.out.println("No");
					System.exit(0);
				}
			}
			System.out.println("Yes");
		sc.close();
	}
}