{"raw_statement":[{"iden":"problem statement","content":"There are three Takahashis numbered $1$, $2$ and $3$, and three hats colored red, green, and blue. Each Takahashi is wearing one hat. The color of the hat that Takahashi $i$ is currently wearing is represented by a character $S_i$. Here, `R` corresponds to red, `G` to green, and `B` to blue. Now, they will do the following operation **exactly** $10^{18}$ times.\n\n#### Operation\n\n*   Choose two out of the three Takahashis. The two exchange the hats they are wearing.\n\nIs it possible to make Takahashi $i$ wearing the hat of color corresponding to character $T_i$ after the $10^{18}$ repetitions?"},{"iden":"constraints","content":"*   $S_1, S_2, S_3$ are a permutation of `R`, `G`, `B`.\n*   $T_1, T_2, T_3$ are a permutation of `R`, `G`, `B`."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$S_1$ $S_2$ $S_3$\n$T_1$ $T_2$ $T_3$"},{"iden":"sample input 1","content":"R G B\nR G B"},{"iden":"sample output 1","content":"Yes\n\nFor example, the objective can be achieved by repeating $10^{18}$ times the operation of swapping the hats of Takahashi $1$ and Takahashi $2$."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}