Chef-jumping Solution

 

Problem

This morning Chef wants to jump a little. In a few minutes he will arrive at the point 0. Then he will perform a lot of jumps in such a sequence: 1-jump, 2-jump, 3-jump, 1-jump, 2-jump, 3-jump, 1-jump, and so on.

1-jump means that if Chef is at the point x, he will jump to the point x+1.

2-jump means that if Chef is at the point x, he will jump to the point x+2.

3-jump means that if Chef is at the point x, he will jump to the point x+3.

Before the start Chef asks you: will he arrive at the point a after some number of jumps?

Input

The first line contains a single integer a denoting the point Chef asks about.

Output

Output "yes" without a quotes if Chef can arrive at point a or "no" without a quotes otherwise.

Constraints

• 0 ≤ a ≤ 1018

Sample 1:

Input

Output

0

yes

Sample 2:

Input

Output

1

yes

Sample 3:

Input

Output

2

no

Sample 4:

Input

Output

3

yes

Sample 5:

Input

Output

6

yes

Sample 6:

Input

Output

7

yes

Sample 7:

Input

Output

10

no

Explanation:

The first reached points are: 0 (+1) 1 (+2) 3 (+3) 6 (+1) 7, and so on.

Program :

#include <stdio.h>

int main(void) {

long long a;

scanf("%lld",&a);

a%=6;

if(a==0 || a==1 || a==3)

{

    printf("yes\n");

}

else

{

    printf("no\n");

}

return 0;

}