\problemname{Coins}
% \illustration{.3}{pic}{\href{https://www.flickr.com/photos/44124483743@N01/60951926}{CC-BY 2.0, Paulo via Flickr}}
\illustration{.15}{coinstack}{\href{https://www.hippopx.com/en/gold-coin-business-money-pile-gold-coins-stack-325690}{CC0, via Hippopx}}%
%
You have been challenged by the infamous magician Zhivago to his
signature coin game! The game starts off with a pile of $n$ coins,
where you and Zhivago will each take turns grabbing coins from the
pile, and the loser is the one that grabs the last coin. Each player
has to take $1$, $2$ or $3$ coins each turn; no more, no less!

Zhivago is a master in his own game, and will always play optimally.
However, you have been informed that you are in a winning position, and can
best Zhivago to become the coin game champion. Can you do it?

\section*{Interaction}
First, your program should read a single integer $ 1 \leq n < 1000$, the number of coins
in the pile at the start of the game.
Then, we repeat the following process:
\begin{itemize}
    \item Your program writes a single line to the standard output,
        in the form of an integer $1$, $2$ or $3$ that represents the move you make.
    \item After you have made your move, then your program should read a single integer
        $c \in \{1, 2, 3\}$ representing how many coins Zhivago takes on his turn.
    \item If there is only a single coin left for Zhivago, he will output the string ``\texttt{I give up}'' instead.
        At this point your program should terminate.
\end{itemize}
After making each move, do not forget to \textbf{flush} the output. To do this, use:
\begin{itemize}
    \item \texttt{fflush(stdout)} or \texttt{cout.flush()} in C++;
    \item \texttt{System.out.flush()} in Java;
    \item \texttt{stdout.flush()} or \texttt{print(output, flush=True)} in Python;
    \item see documentation for other languages.
\end{itemize}

\section*{Sample game}

\begin{table}[h]
    \def\arraystretch{2}%
    \begin{tabular}{l|l|l}
        \textit{Your output} & \textit{Zhivago output}  & \textit{Interpretation}             \\
        \hline
                      & \texttt{7}    & There are $ n = 7 $ coins as the starting amount in the pile.    \\
        \hline
        \texttt{2}  & \texttt{1}    & You take $2$ coins and Zhivago responds by taking $1$ coin. \\
        \hline
        \texttt{3}  & \texttt{I give up}  & You take $3$ coins. Since there is only $1$ coin left, Zhivago gives up.    
    \end{tabular}
\end{table}
