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 Go (1.6) (judge verdict: Wrong Answer)

package main

import (
	"fmt"
)

func main() {
	var s, t string
	fmt.Scan(&s, &t)
	sb := make([]bool, 26)
	tb := make([]bool, 26)
	for _, v := range s {
		sb[v-'a'] = true
	}
	for _, v := range t {
		tb[v-'a'] = true
	}
	sk := 0
	tk := 0
	for i := 0; i < 26; i++ {
		if sb[i] {
			sk++
		}
		if tb[i] {
			tk++
		}
	}
	if sk != tk {
		fmt.Println("No")
		return
	}
	for i := 0; i < 26; i++ {
		ch := 'a' + i
		first := true
		tc := 0
		for j, v := range s {
			if int(v) == ch {
				if first {
					tc = int(t[j])
				} else {
					if int(t[j]) != tc {
						fmt.Println("No")
						return
					}
				}
			}
		}
	}
	fmt.Println("Yes")
}