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 Kotlin (1.0.0) (judge verdict: Runtime Error)

fun c110(args: Array<String>) {
    var mapA = mutableMapOf<Char, Int>()
    args[0].forEach {
        if (mapA.containsKey(it)) {
            mapA.put(it, 0)
        }
        mapA.put(it, mapA.get(it)!! + 1)
    }

    var mapB = mutableMapOf<Char, Int>()
    args[1].forEach {
        if (mapB.containsKey(it)) {
            mapB.put(it, 0)
        }
        mapB.put(it, mapA.get(it)!! + 1)
    }

    println(if (mapA.values.sorted() == mapB.values.sorted()) "Yes" else "No")
}

fun main(args: Array<String>) {
    c110(readLineList())
}

fun readLineList(): Array<String> {
    val lineList = mutableListOf<String>()
    while (true) {
        val line = readLine()
        if (line.isNullOrBlank()) {
            break
        } else {
            lineList.add(line!!)
        }
    }
    return lineList.toTypedArray()
}