Two friends, Yamca and Yamochka, really love drinking lemonade and buy it in bottles and in very large quantities. In total, they buy three kinds of lemonade, which can be distinguished by the colors of the caps on their bottles. Only Yamochka drinks lemonade with red caps, only Yamca drinks lemonade with blue caps, and both of them drink lemonade with green caps.

Unfortunately, many bottles remain after drinking the lemonade, and someone has to throw them away. To decide who will be burdened with this unenviable task, Yamca and Yamochka play the following game. In front of them there are N piles of caps in a row, and all caps in one pile have the same color. The players take turns, with Yamochka moving first. On their turn, a player may take any number of caps from any one pile, if they drink lemonade with caps of that color. More formally: Yamca may take from blue and green piles, and Yamochka — from red and green ones. If a player cannot make a move, the game ends immediately, and that player goes to take out the trash.

You know that neither Yamca nor Yamochka wants to take out the trash, so determine who will win with optimal play from both sides.

The first line contains an integer N (1 ≤ N ≤ 2 · 10⁵) — the number of piles.

The second line contains N positive integers a_i (1 ≤ a_i < 2³⁰) separated by spaces — the number of caps in the i-th pile.

The third line contains a string s of length N consisting of the characters RGB. R means that the i-th pile consists of red caps, B — of blue caps, and G — of green caps.

In a single line, output who will win:

• “Yamca” if Yamca wins;
• “YamOCHca” if Yamochka wins.