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++ (GCC 9.2.1) (judge verdict: Wrong Answer)

#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
	string s,t;
	cin>>s>>t;
	sort(s.begin(),s.end());
	sort(t.begin(),t.end());
	map<ll,ll> map1,map2;
	
	for(ll i=0;i<s.size();i++){
		map1[s[i]]++;
		map2[t[i]]++;
	}
	
	bool bb=1;
	std::map<ll,ll> ::iterator it,it2;
	for(ll i=0;i<26;i++){
		char c='a'+i;
		it=map1.find(c);
		it2=map2.find(c);
		if(it==map1.end()||it2==map2.end()) continue;
		if(it2->second>it->second&&it->second>0&&it2->second>0){
			bb=0;
		}
	}
	if(bb) cout<<"Yes"<<endl;
	else cout<<"No"<<endl;
}