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

pub fn read_stdin() -> String {
    let mut s = String::new();
    ::std::io::stdin().read_to_string(&mut s).unwrap();
    s
}

pub trait Parse {
    fn to<T>(&mut self) -> T
    where
        T: std::str::FromStr;
}

impl<'a> Parse for std::str::SplitWhitespace<'a> {
    fn to<T>(&mut self) -> T
    where
        T: std::str::FromStr,
    {
        let word = self.next().unwrap();
        word.parse().ok().unwrap()
    }
}

fn group_by_same(v: Vec<char>) -> Vec<Vec<char>> {
    let mut groups = Vec::new();
    let mut group = Vec::new();
    group.push(v[0]);
    for i in 1..v.len() {
        if v[i - 1] != v[i] {
            groups.push(group);
            group = Vec::new();
        }
        group.push(v[i]);
    }
    if !group.is_empty() {
        groups.push(group);
    }
    groups
}


fn main() {
    let source = read_stdin();
    let mut iter = source.split_whitespace();
    let s = iter.to::<String>().chars().collect::<Vec<_>>();
    let t = iter.to::<String>().chars().collect::<Vec<_>>();

    let mut map = HashMap::new();
    for a in "abcdefghijklmnopqrstuvwxyz".chars() {
        map.insert(a, Vec::new());
    }

    for (i, tc) in t.iter().enumerate() {
        if let Some(v) = map.get_mut(tc) {
            v.push(i);
        }
    }

    for (c, indices) in map {
        if indices.is_empty() {
            continue;
        }
        let first = s[indices[0]];
        let st0 = indices.iter().all(|&i| s[i] == first);
        let mut sc = indices.iter().map(|&i| s[i]).collect::<Vec<_>>();
        sc.sort();
        let st1 = group_by_same(sc).into_iter().all(|group| group.len() <= 1);
        let st2 = indices.iter().all(|&i| s[i] != c);
        if !st0 && !(st1 && st2) {
            println!("No");
            return;
        }
    }
    println!("Yes");
}