As stated in a previous problem, Yessine is a wealthy business man who founded Iceberg Corporation and hired Oussama to work for him. The start-up grew significantly, so he bought a big office and hired one additional employee who can't be anyone other than Rami . The three of them would meet every evening (because none of them would wake up in the morning), and they would work together. Everything was perfect, except for one thing... Sometimes, Rami and Yessine would make Shisha and start smoking in the office. Oussama doesn't really like smoking, so he asked them to stop. They refused at first, but he kept insisting, so they told him they will stop if he wins in a divisibility game.

Oussama and Rami will play on an array $$$A$$$ of $$$n$$$ positive integers, and they agreed on some odd integer $$$k$$$ before starting the game. Oussama and Rami will make alternating moves. But this time, and unlike previous Winter Cups, Oussama insisted on going first. In each turn, the current player will play as follows:

• If every element is divisible by $$$k$$$, the player loses the game.
• Otherwise, the player will have to choose two elements $$$A_{i}$$$ and $$$A_{j}$$$, remove them, and add $$$A_{i}+A_{j}$$$ to the end of the array.

It's guaranteed that the sum of the elements of the array is divisible by $$$k$$$.

Oussama is very good at games, but so is Rami, so both players play optimally. Help Oussama win before his lungs get sick from Shisha.