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 Scala (2.11.7) (judge verdict: Wrong Answer)

import scala.util.control.Breaks
object Main {
  def main(args: Array[String]) {
    var check_flg:Array[Int] = Array.fill(26)(0)
    val break = new Breaks

    val str1 = scala.io.StdIn.readLine()
    val str2 = scala.io.StdIn.readLine()
    val ascii_change = 'a'.toByte
    var check = true

    break.breakable {
      for(i <- 0 until str1.length) {
        val str1_ascii = str1(i) - ascii_change
        val str2_ascii = str2(i) - ascii_change
        if((check_flg(str1_ascii) == 1 && check_flg(str2_ascii) == 0) || (check_flg(str1_ascii) == 0 && check_flg(str2_ascii) == 1)) {
          check = false
          break
        }

        check_flg(str1_ascii) = 1
        check_flg(str2_ascii) = 1
      }
    }

    if(check) {
      println("Yes")
    }
    else {
      println("No")
    }
  }
}