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 C++14 (GCC 5.4.1) (judge verdict: Time Limit Exceeded)

#include<bits/stdc++.h>
using namespace std;


typedef long long ll;
typedef double db;
int main(){
	char a[200005] , b[200005];
	scanf("%s %s",a,b);
	int book[26];
	int len = strlen(a);
	memset(book,0,sizeof(book));
	for(int i = 0 ; i < len ; i ++){
		if(a[i] == b[i]) {
			book[a[i]-'a'] = 1;
			continue;
		}
		else{
			if(book[a[i]-'a'] != 1){
				char ta = a[i],tb = b[i];
				for(int j = 0 ; j < len ; j ++){
					if(a[j] == ta) a[j] = tb;
					else if(a[j] == tb) a[j] = ta;
				}
				// cout << a << " " << b << endl;
				book[a[i]-'a'] = 1;
			}
		}
	}
	if(!(strcmp(a,b))){
		printf("Yes");
	}else{
		printf("No");
	}
	












	return 0;
}