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::*;
use std::str::FromStr;

pub fn read<T: FromStr>() -> T {
    let stdin = stdin();
    let stdin = stdin.lock();
    let token: String = stdin
        .bytes()
        .map(|c| c.expect("failed to read char") as char)
        .skip_while(|c| c.is_whitespace())
        .take_while(|c| !c.is_whitespace())
        .collect();
    token.parse().ok().expect("failed to parse token")
}

use std::collections::HashMap;

fn main() {
    let s: Vec<char> = read::<String>().chars().collect();
    let t: Vec<char> = read::<String>().chars().collect();
    let mut map: HashMap<char, char> = HashMap::new();

    for i in 0..s.len() {
        if !map.contains_key(&s[i]) {
            map.insert(s[i], t[i]);
        } else {
            let current = map.get(&s[i]).unwrap();
            if *current != t[i] {
                // println!("{} {}", current, t[i]);
                println!("No");
                return;
            }
        }
    }
    let mut map: HashMap<char, char> = HashMap::new();
    let tmp = t;
    let t = s;
    let s = tmp;

    for i in 0..s.len() {
        if !map.contains_key(&s[i]) {
            map.insert(s[i], t[i]);
        } else {
            let current = map.get(&s[i]).unwrap();
            if *current != t[i] {
                // println!("{} {}", current, t[i]);
                println!("No");
                return;
            }
        }
    }
    println!("Yes");
}