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`.

Examples

Input

azzel
apple


Output

Yes


Input

chokudai
redcoder


Output

No


Input

abcdefghijklmnopqrstuvwxyz
ibyhqfrekavclxjstdwgpzmonu


Output

Yes
import java.util.Scanner;
import java.util.stream.Collectors;

public class Main {

    public static void main(String[] args) {
        Scanner reader = new Scanner(System.in);
        String first = reader.nextLine();
        String second = reader.nextLine();
        System.out.println(first.chars()
                .distinct()
                .mapToLong(a -> first.chars()
                        .filter(el -> el == a)
                        .count())
                .boxed()
                .sorted()
                .collect(Collectors.toList())
                .equals(second.chars()
                        .distinct()
                        .mapToLong(a -> second.chars()
                                .filter(el -> el == a)
                                .count())
                        .boxed()
                        .sorted()
                        .collect(Collectors.toList())) ? "Yes" : "No");
    }
}