You and your best friend, Timo are playing an interesting turn-based game.
Before the two of you are a stack of N sticks.
In each turn, the player is allowed to remove from the stack a number of sticks X, such that √X is an integral value and X≠0.
If it is a player's turn and they can not remove a certain number of sticks that follow the above constraint, they lose!
You take the first turn.
Print a single boolean value indicating if you will win (true if you will win and false if you won't win).
Both players play optimally.
Input Format:
A single integer N indicating the number of sticks in the initial stack.
1≤N≤105
Output Format:
A single boolean value (true or false) indicating if you will win the game.
You have only one choice in your first move, remove 1 stick (X=1). Timo now has only 1 choice as well, he removes 1 stick.
In your 2nd turn, there are no sticks left and hence you cannot remove X number of sticks that match the given conditions.
Hence you lose.
