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 Common Lisp (SBCL 2.0.3) (judge verdict: Accepted)

(defparameter *char-list*
  (loop for i below 26 collect (code-char (+ (char-code #\a)
                                             i))))
(defun lst-equal-p (xs ys)
  (if (null xs)
      t
      (if (equal (first xs) (first ys))
          (lst-equal-p (rest xs)
                       (rest ys))
          nil)))

(defun make-pos-list (lst chr &optional (acc nil) (cnt 0))
  (if (null lst)
      (reverse acc)
      (progn
        (when (char-equal (first lst) chr)
          (push cnt acc))
        (make-pos-list (rest lst) chr acc (1+ cnt)))))

(defun solve (s1 s2)
  (let ((p1 (sort (remove-if #'null
                             (mapcar (lambda (c) (make-pos-list s1 c))
                                     *char-list*))
                  (lambda (xs ys) (< (first xs) (first ys)))))
        (p2 (sort (remove-if #'null
                             (mapcar (lambda (c) (make-pos-list s2 c))
                                     *char-list*))
                  (lambda (xs ys) (< (first xs) (first ys))))))
    (if (/= (length p1) (length p2))
        "No")
    (if (lst-equal-p p1 p2)
        "Yes"
        "No")))

(defun main ()
  (let ((str1 (concatenate 'list (read-line)))
        (str2 (concatenate 'list (read-line))))
    (format t "~a~%" (solve str1 str2))))

(main)