The Problem

Katja likes to switch the lights off and on in different hallways at Hochschule Ravensburg-Weingarten. A hallway has n lights, each controlled by one toggle switch. The first time a toggle switch is pressed, the light turns on. The second time a toggle switch is pressed, the light turns off. Etc. Katja walks along this corridor back and forth n times. On the k^th walk she toggles only the switches whose position is evenly divisble by k. She does not press any switch when returning to the start of the hallway. The k^th walk is defined as going down the hallway and coming back again.

For this problem, you must write a program that determines the state of the final bulb.

Input: light.in

There will be an unknown number of positive integers in the file, terminated by a 0. Each positive integer indicates the number of bulbs in the corridor, n. n is ≤ 2³²-1. Do not process the 0.

Output: light.out

Output yes if the light is on, otherwise no. Each answer should appear on a single line.

Sample Input

3
6241
8191
0

Sample Output

no
yes
no