Fibonacci Again

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Problem Description

There are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2).

Input

Input consists of a sequence of lines, each containing an integer n. (n < 1,000,000).

Output

Print the word "yes" if 3 divide evenly into F(n).

Print the word "no" if not.

Sample Input

0
1
2
3
4
5

Sample Output

no
no
yes
no
no
no

Author

Leojay

找规律题：

f(n)依次是7,11,18,29,47,76,123,199,

322,521,843,1364,2207。3571,5778,9349

除以三时候各自是 1,2,0,2,2,1,0,1

1,2,0,2,2,1,0,1

周期是八 一般的计算方法就会超时

<span style="font-size:24px;">#include<stdio.h>
int main()
{
	int n;
	while(~scanf("%d",&n))
	{
		if(n%4==2)
		printf("yes\n");
		else
		printf("no\n");
	}
	return 0;
}</span>