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

012345

 

Sample Output

nonoyesnonono

 

这个题是大数据，开始怎么做也是错的，后来才知道要找规律，既然要求能够整除三，就让结果整除三，发现n=2,6,10，14。。时可以，所只要满足（n-2）%4==0即可！

 

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