Fibonacci Again

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
    
    

 

这题太水了，题目中给了另一组斐波那契，输入一系列的数，输出对应的斐波那契数是否能被3整除，如果直接做，就有TLE的风险，这组斐波那契数依次为：7   11   18   29   47   76   123   199   322   521   843

AC代码：

#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;
}