Omar plays a game#9792
Omar has decided to play a game suggested by Guseyn. Each day, Omar selects two different lowercase letters from the English alphabet, and . He then swaps all occurrences of with , and vice versa, in every word.
You are given two strings, and , both consisting only of lowercase English letters. Your task is to determine if Omar can transform string into string after some number of days (including possibly zero days).
The first line contains the string .The second line contains the string .
|s| = |t| (1 \leq |s| \leq 2 \cdot 10^5)
Print Yes if Omar can transform string into string ; otherwise, print No.
Example 1
Example 2