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.42.0) (judge verdict: Accepted)

#![allow(unused, non_snake_case, dead_code, non_upper_case_globals)]
use {
    proconio::{marker::*, *},
    std::{cmp::*, collections::*, mem::*},
};
fn main() {
    input! {//
        s:Chars,
        t:Chars,
    }
    let mut mps = BTreeMap::new();
    let mut mpt = BTreeMap::new();
    for (&s, &t) in s.iter().zip(t.iter()) {
        *mps.entry(s).or_insert(0) += 1;
        *mpt.entry(t).or_insert(0) += 1;
    }
    let mut vs = vec![];
    let mut vt = vec![];
    for (key, value) in mps {
        vs.push(value);
    }
    for (key, value) in mpt {
        vt.push(value);
    }
    vs.sort();
    vt.sort();
    for (&s, &t) in vs.iter().zip(vt.iter()) {
        if s != t {
            yn(false);
            return;
        }
    }
    yn(true);
}

pub fn yn(ans: bool) {
    if ans {
        println!("Yes");
    } else {
        println!("No");
    }
}