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: Wrong Answer)

use std::io::Read;


fn solve(s: &str, t: &str) -> bool{
    let vs: Vec<char> = s.chars().collect();
    let vt: Vec<char> = t.chars().collect();
    let mut char_map1 = [-1; 256];
    let mut char_map2 = [-1; 256];

    for i in 0..vs.len() {
        let c1 = vs[i] as usize;
        let c2 = vt[i] as usize;
        if char_map1[c1] != -1 {
            return false;
        }
        char_map1[c1] = c2 as i32;
        if char_map2[c2] != -1 {
            return false;
        }
        char_map2[c2] = c1 as i32;
    }

    return true;
}

fn main() {
    let mut buf = String::new();

    std::io::stdin().read_to_string(&mut buf).unwrap();

    let mut iter = buf.split_whitespace();
    let s = iter.next().unwrap();
    let t = iter.next().unwrap();
    println!("{}", if solve(s,t) { "Yes" } else { "No "});
}