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;
use std::cmp;
use std::collections::BinaryHeap;
use std::collections::HashMap;

fn read_line() -> String {
    let mut buf = String::new();
    io::stdin().read_line(&mut buf).ok();
    buf
}

fn judge(s: &[u8], t: &[u8],) -> bool {
    let mut memo: HashMap<u8, u8> = HashMap::new();
    let mut used: HashMap<u8, u8> = HashMap::new();

    for i in 0..s.len() {
        if let Some(c) = memo.get(&s[i]).cloned() {
            if c != t[i] {
                return false;
            }
        } else if let Some(c) = used.get(&s[i]).cloned() {
            if c == t[i] {
                memo.insert(s[i], t[i]);
                used.insert(t[i], s[i]);
            } else if let Some(d) = used.get(&t[i]).cloned() {
                return false;
            } else {
                memo.insert(s[i], t[i]);
                used.insert(t[i], s[i]);
            }
        } else {
            memo.insert(s[i], t[i]);
            used.insert(t[i], s[i]);
        }
    }
    return true;
}

fn main() {
    let line = read_line();
    let s = line.trim().as_bytes(); 
    let line = read_line();
    let t = line.trim().as_bytes();

    if judge(s, t) {
        println!("Yes");
    } else {
        println!("No");
    }
}