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: Time Limit Exceeded)

import java.util.Scanner

import scala.annotation.tailrec
import scala.collection.mutable.{Map => MMap}

object Main extends App {
  val sc = new Scanner(System.in)
  val (s, t) = (sc.next.toCharArray, sc.next.toCharArray)
  val s2t = MMap.empty[Char, Char]
  val t2s = MMap.empty[Char, Char]
  var result = true

  @tailrec
  def lp(e: Seq[(Char, Char)]): Unit = {
    e match {
      case (ss, tt) +: rest =>
        val last_s2t = s2t.put(ss, tt)
        val last_t2s = t2s.put(tt, ss)
        if (last_s2t.exists(_ != tt) || last_t2s.exists(_ != ss)) {
          result = false
        } else {
          lp(rest)
        }
      case _ =>
    }
  }

  lp(s zip t)

  println(if (result) "Yes" else "No")
}