{"raw_statement":[{"iden":"problem statement","content":"You are given two strings $S$ and $T$. Determine whether it is possible to make $S$ and $T$ equal by doing the following operation **at most once**:\n\n*   choose two adjacent characters in $S$ and swap them.\n\nNote that it is allowed to choose not to do the operation."},{"iden":"constraints","content":"*   Each of $S$ and $T$ is a string of length between $2$ and $100$ (inclusive) consisting of lowercase English letters.\n*   $S$ and $T$ have the same length."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$S$\n$T$"},{"iden":"sample input 1","content":"abc\nacb"},{"iden":"sample output 1","content":"Yes\n\nYou can swap the $2$\\-nd and $3$\\-rd characters of $S$ to make $S$ and $T$ equal."},{"iden":"sample input 2","content":"aabb\nbbaa"},{"iden":"sample output 2","content":"No\n\nThere is no way to do the operation to make $S$ and $T$ equal."},{"iden":"sample input 3","content":"abcde\nabcde"},{"iden":"sample output 3","content":"Yes\n\n$S$ and $T$ are already equal."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}