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 Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Map;
import java.util.Scanner;
import java.util.HashMap;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        ABC_110_C solver = new ABC_110_C();
        solver.solve(1, in, out);
        out.close();
    }

    static class ABC_110_C {
        public void solve(int testNumber, Scanner in, PrintWriter out) {

            String sourceStr = in.next();
            String targetStr = in.next();
            char[] source = sourceStr.toCharArray();
            char[] target = targetStr.toCharArray();
            Map<Character, Character> mapper1 = new HashMap<>();
            Map<Character, Character> mapper2 = new HashMap<>();

            for (int i = 0; i < source.length; i++) {
                if (mapper1.containsKey(source[i])) {
                    if (mapper1.get(source[i]) != target[i]) {
                        out.print("No");
                        return;
                    }
                }
                if (mapper2.containsKey(target[i])) {
                    if (mapper2.get(target[i]) != source[i]) {
                        out.print("No");
                        return;
                    }
                }
                mapper1.put(source[i], target[i]);
                mapper2.put(target[i], source[i]);
            }
            out.print("Yes");
        }

    }
}