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 func(input_str: &str) {
    let mut iter = input_str.split_whitespace();
    let s = iter.next().unwrap().chars();
    let t = iter.next().unwrap().chars();
    let mut cnt_s = s.fold(vec![0; 26], |mut cnt_v, x| {
        cnt_v[x as usize - 'a' as usize] += 1;
        cnt_v
    });
    let mut cnt_t = t.fold(vec![0; 26], |mut cnt_v, x| {
        cnt_v[x as usize - 'a' as usize] += 1;
        cnt_v
    });
    cnt_s.sort();
    cnt_s.reverse();
    cnt_t.sort();
    cnt_t.reverse();
    if cnt_s == cnt_t {
        println!("Yes");
    } else {
        println!("No");
    }
}

use std::io::Read;

fn main() {
    let mut buf = String::new();
    std::io::stdin().read_to_string(&mut buf).unwrap();
    func(&buf[..]);
}