B - Fibonacci Again

B - Fibonacci Again

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

#include<stdio.h>
int main()
{
	int n;
	while(~(scanf("%d",&n)))
	{
		if((n+2)%4==0)printf("yes\n");
		else printf("no\n");
	}

}

根据斐波那契数列的规律，每隔四个就可以被三整除
这里列出前20项