String Transformation :
Difficulty Level : Medium
Submissions : 294
Asked In :
Marks :100
: 0 | : 0
You are given two strings S and T of the same length. You need to determine if its possible to transform string S into T with the following rule any number of times.
You can map a character from string S to a character of string T and replace all the occurrences of that character in string S.
Input
The first line of input contains two strings S and T($$$1 \le S, T \le 10^5$$$)
Output
For every test case return YES Or NO in a new line indicating its possible to transform S into T
Examples
Input
abc bbb
Output
YES
Input
abcde aa
Output
NO
Note
All occurrences of a character must be replaced with another character while preserving the order of the character.
No two characters may map to the same character, but a character may map to itself
