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::Read;
use std::collections::HashSet;

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

    let answer = solve(&buf);

    println!("{}", answer);
}

fn solve(input: &str) -> String {
    let mut iterator = input.split_whitespace();

    let s: Vec<char> = iterator.next().unwrap().chars().collect();
    let t: Vec<char> = iterator.next().unwrap().chars().collect();

    let p: Vec<Vec<usize>> = destruct(&s);
    let q: Vec<Vec<usize>> = destruct(&t);

    if p.len() != q.len() {
        return "No".to_string();
    }

    for i in 0..p.len() {
        let pi = &p[i];
        let qi = &q[i];
        if pi.len() != qi.len() {
            return "No".to_string();
        }
        for j in 0..pi.len() {
            if pi[j] != qi[j] {
                return "No".to_string();
            }
        }
    }

    return "Yes".to_string()
}

fn destruct(s: &Vec<char>) -> Vec<Vec<usize>> {
    let mut result: Vec<Vec<usize>> = Vec::new();

    let mut checked: HashSet<char> = HashSet::new();
    for i in 0..s.len() {
        let c = s[i];
        if checked.contains(&c) {
            continue;
        }
        let mut v: Vec<usize> = Vec::new();
        for j in 0..s.len() {
            if s[j] == c {
                v.push(j);
            }
        }
        result.push(v);
        checked.insert(c);
    }

    result.sort();
    return result;
}