{"raw_statement":[{"iden":"problem statement","content":"You are given strings $S$ and $T$ consisting of lowercase English letters.\nYou can perform the following operation on $S$ any number of times:\nOperation: 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$.\nDetermine if $S$ and $T$ can be made equal by performing the operation zero or more times."},{"iden":"constraints","content":"*   $1 \\leq |S| \\leq 2 \\times 10^5$\n*   $|S| = |T|$\n*   $S$ and $T$ consists of lowercase English letters."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$S$\n$T$"},{"iden":"sample input 1","content":"azzel\napple"},{"iden":"sample output 1","content":"Yes\n\n`azzel` can be changed to `apple`, as follows:\n\n*   Choose `e` as $c_1$ and `l` as $c_2$. `azzel` becomes `azzle`.\n*   Choose `z` as $c_1$ and `p` as $c_2$. `azzle` becomes `apple`."},{"iden":"sample input 2","content":"chokudai\nredcoder"},{"iden":"sample output 2","content":"No\n\nNo sequences of operation can change `chokudai` to `redcoder`."},{"iden":"sample input 3","content":"abcdefghijklmnopqrstuvwxyz\nibyhqfrekavclxjstdwgpzmonu"},{"iden":"sample output 3","content":"Yes"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}