문제<\/h2>
This is a run-twice problem.<\/em><\/p>
A team of $n<\/mi><\/mrow>n<\/math><\/span><\/span> n<\/span><\/span><\/span><\/span> players is sitting around a large round table in a library and playing a cooperative game. Each player has a card with an integer from 1<\/mn><\/mrow>1<\/math><\/span><\/span> 1<\/span><\/span><\/span><\/span> to n<\/mi><\/mrow>n<\/math><\/span><\/span> n<\/span><\/span><\/span><\/span> glued to their forehead. Players can see each other's numbers but cannot see their own numbers, which they are trying to guess. Since the game takes place in a library where everyone must be quiet, players make their guesses in writing and simultaneously, without communicating with each other. The team wins if at least one player guesses their number correctly.<\/p> Your task is to devise a winning strategy for the team. The strategy will be tested in two runs.<\/p> During the first run, you will be given the numbers on the cards of all players at the table in clockwise order. After that, you need to select the number of the player who will correctly guess their card.<\/p> During the second run, you will be informed of the number of the chosen player, as well as the numbers on the cards that this player can see from their position, from left to right. In response, you have to output the number on the chosen player's card.<\/p> 입력<\/h2> During both runs, the first line contains a single integer: 0<\/mn><\/mrow>0<\/math><\/span><\/span> 0<\/span><\/span><\/span><\/span> if it is the first run, or the number of the player chosen during the first run if it is the second run.<\/p> The second line contains an integer n<\/mi><\/mrow>n<\/math><\/span><\/span> n<\/span><\/span><\/span><\/span>: the number of players, or the number of cards visible to the player (n<\/mi>$

Who Am I?