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 JavaScript (node.js v5.12) (judge verdict: Accepted)

// inputに入力データ全体が入る
function Main(input) {
	// 1行目がinput[0], 2行目がinput[1], …に入る
	input = input.split("\n");
	S = input[0];
	T = input[1];

	var inS = [];
	var inT = [];

	var counter = function(str,seq){
		return str.split(seq).length - 1;
	}

	var first = "a", last = "z";
	for(var i = first.charCodeAt(0); i <= last.charCodeAt(0); i++) {
		inS[i] = counter(S, eval("String.fromCharCode(" + i + ")"));
		inT[i] = counter(T, eval("String.fromCharCode(" + i + ")"));
	}

	inS.sort(function(a,b){
        if( a > b ) return -1;
        if( a < b ) return 1;
		return 0;
	});

	inT.sort(function(a,b){
        if( a > b ) return -1;
        if( a < b ) return 1;
		return 0;
	});


	if (inS.toString() == inT.toString()) {
		console.log('Yes');
	} else {
		console.log('No');
	}
}
//*この行以降は編集しないでください（標準入出力から一度に読み込み、Mainを呼び出します）
Main(require("fs").readFileSync("/dev/stdin", "utf8"));