hdu 6312

 

 

Problem Description

Alice and Bob are playing a game.
The game is played on a set of positive integers from 1 to n.
In one step, the player can choose a positive integer from the set, and erase all of its divisors from the set. If a divisor doesn't exist it will be ignored.
Alice and Bob choose in turn, the one who cannot choose (current set is empty) loses.
Alice goes first, she wanna know whether she can win. Please judge by outputing 'Yes' or 'No'.

 

 

Input

There might be multiple test cases, no more than 10. You need to read till the end of input.
For each test case, a line containing an integer n. (1≤n≤500)

 

 

Output

A line for each test case, 'Yes' or 'No'.

 

 

Sample Input

1

 

 

Sample Output

Yes

 

 

Source

2018 Multi-University Training Contest 2

 

 

Recommend

chendu   |   We have carefully selected several similar problems for you:  6318 6317 6316 6315 6314 

 

 

 

 

// 当2到N为必胜局面时，先手就去1和必胜时应取得数，则先手一定必胜
// 当2到N为必败局面时，先手就取1，则把必败局面给后手，则先手必胜
int main()
{   int n;
    while(~scanf("%d",&n)){
        printf("Yes\n");
    }
    return 0;
}