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)

// Try AtCoder
// author: Leonardone @ NEETSDKASU

fn main() {
	let mut stdin = String::new();
    std::io::Read::read_to_string(
    	&mut std::io::stdin(),
        &mut stdin).unwrap();
	let mut stdin = stdin.split_whitespace();
    let mut get = || stdin.next().unwrap();

	let s = get().as_bytes();
    let t = get().as_bytes();
    
    if s.len() != t.len() {
    	println!("No");
        return;
    }
    
    use std::collections::HashMap;
    
    let mut hs = HashMap::new();
    let mut ht = HashMap::new();
    
    for i in 0..s.len() {
    	let cs = s[i];
        let x = hs.len();
        let p = *hs.entry(cs).or_insert(x);
        let ct = t[i];
        let y = ht.len();
        let q = *ht.entry(ct).or_insert(y);
        if p != q {
        	println!("No");
            return;
        }
    }
    
    println!("Yes");
    
}