Omar plays a game

Omar has decided to play a game suggested by Guseyn. Each day, Omar selects two different lowercase letters from the English alphabet, a and b. He then swaps all occurrences of a with b, and vice versa, in every word.

You are given two strings, s and t, both consisting only of lowercase English letters. Your task is to determine if Omar can transform string s into string t after some number of days (including possibly zero days).

Input

The first line contains the string s.The second line contains the string t.

|s| = |t| (where 1 <= |s| <= 2*10^5)

Output

Print Yes if Omar can transform string s into string t; otherwise, print No.

Examples