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: Accepted)

#include <bits/stdc++.h>

#define REP(i, n) for(int i = 0;i < (n);i++)
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;

typedef pair<int, int> P;
typedef pair<int, P> PP;

int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};

//---------------------------------------------------------------
//---------------------------------------------------------------

string S, T;
map<int, int> ST;
map<int, int> TS;

signed main(){
	cin >> S;
	cin >> T;
	
	int s, t;
	REP(i, S.size()) {
		s = S[i] - 'a' + 1;
		t = T[i] - 'a' + 1;
		if((ST[s] != 0 && ST[s] != t)
					|| (TS[t] != 0 && TS[t] != s)) {

//		    cout << S[i] << " ST[" << s << "] = " << ST[s] << " != " << t << endl;
//		    cout << T[i] << " TS[" << t << "] = " << TS[t] << " != " << s << endl;

			cout << "No" << endl;
			return 0;
		} else {
			ST[s] = t;
			TS[t] = s;
//		    cout << "set  " << S[i] << "  ST[" << s << "] = " << t << "]" << endl;
//		    cout << "set  " << T[i] << "  TS[" << t << "] = " << s << "]" << endl;
		}
	}
	cout << "Yes" << endl;
	
	return 0;
}