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 Rust (1.15.1) (judge verdict: Accepted)

fn read_string() -> String {
    let mut input = String::new();
    let _ = std::io::stdin().read_line(&mut input);
    input.trim().to_string()
}

fn main () {
    let s = read_string();
    let t = read_string();
    let mut map1: Vec<usize> = vec![0; 26];
    let mut map2: Vec<usize> = vec![0; 26];
    for (i, j) in s.chars().zip(t.chars()) {
        let idx1 = (i as usize) - ('a' as usize);
        let idx2 = (j as usize) - ('a' as usize);
        if map1[idx1] == 0 && map2[idx2] == 0 {
            map1[idx1] = j as usize;
            map2[idx2] = i as usize;
        } else if map1[idx1] != j as usize || map2[idx2] != i as usize {
            println!("No");
            return;
        }
    }
    println!("Yes");
}