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`.

Examples

Input

azzel
apple


Output

Yes


Input

chokudai
redcoder


Output

No


Input

abcdefghijklmnopqrstuvwxyz
ibyhqfrekavclxjstdwgpzmonu


Output

Yes
#include <bits/stdc++.h>
int main()
{
  std::string S, T;std::cin >>S >> T;
  std::vector<std::vector<int>> p1(26),p2(26);
  for(int i = 0; i < S.size(); i++){p1[S[i]-'a'].push_back(i);}
  for(int i = 0; i < T.size(); i++){p2[T[i]-'a'].push_back(i);}
  std::sort(p1.begin(),p1.end()), std::sort(p2.begin(),p2.end());
  std::cout << (p1==p2?"Yes":"No") << std::endl;
  return 0;
}