In the famous game Stawl Brars, Petya got a new character, whose name is Leon. Petya and his friend Vanya have the same account for both of them, so they decided to play a game and decide who will play for this character first.
The game takes place on a checkered field of size 7 × 7 (see figure below). The players take turns, Petya starts. In one move, you can move Leon either one cell up, or one cell to the left, or one cell diagonally up and to the left. For example, if the character is in a cage
B6, then it can be moved either to cell
A6, or to cell
B5, or to
A5. The winner is the one who first puts Leon in the cell
А1.
The guys agreed that initially the character should stand in any cell of the bottom line. Now Petya wondered how many such cells exist, that if Leon stands in one of them, then Petya will be able to win regardless of Vanya's actions. To do this, he needs your help:
list all the cells on the bottom line, starting from which Petya will be able to win regardless of the opponent's actions.
For your answer, write down all the winning cells on the bottom row separated by a space. The cells on the bottom row are named according to their respective columns. For example, cell
A7 will be written as
A, and cell
G7 — letter
G. This is what the board looks like
Guys: