Swap Hats

AtCoder

IDabc244_d

Time2000ms

Memory256MB

Difficulty—

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. #### Operation * Choose two out of the three Takahashis. The two exchange the hats they are wearing. Is it possible to make Takahashi $i$ wearing the hat of color corresponding to character $T_i$ after the $10^{18}$ repetitions? ## Constraints * $S_1, S_2, S_3$ are a permutation of `R`, `G`, `B`. * $T_1, T_2, T_3$ are a permutation of `R`, `G`, `B`. ## Input Input is given from Standard Input in the following format: $S_1$ $S_2$ $S_3$ $T_1$ $T_2$ $T_3$ [samples]

Samples

Input #1

R G B
R G B

Output #1

Yes

For example, the objective can be achieved by repeating $10^{18}$ times the operation of swapping the hats of Takahashi $1$ and Takahashi $2$.

API Response (JSON)

{
  "problem": {
    "name": "Swap Hats",
    "description": {
      "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 re",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc244_d"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "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 re...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments