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)

use std::io::*;

fn main() {
    let mut s: String = String::new();
    std::io::stdin().read_to_string(&mut s).ok();
    let mut itr = s.trim().split_whitespace();
    let s: Vec<u8> = itr.next().unwrap().bytes().map(|b| b - 97).collect();
    let t: Vec<u8> = itr.next().unwrap().bytes().map(|b| b - 97).collect();

    let mut p1 = vec![26; 26];
    let mut p2 = vec![26; 26];
    for i in 0..s.len() {
        let u = p1[s[i] as usize];
        let v = p2[t[i] as usize];
        if (u != 26 && u != t[i]) || (v != 26 && v != s[i]) {
            println!("No");
            return;
        }
        p1[s[i] as usize] = t[i];
        p2[t[i] as usize] = s[i];
    }
    println!("Yes")
}