Fibonacci Again

Fibonacci Again

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 180   Accepted Submission(s) : 96

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

 

这是一道规律题，或者是数学题，2,6,10,14，，，，，，等可以被3整出，程序如下：
#include <iostream>
using namespace std;
int main()
{
   long T=0;
   while(cin>>T)
   {
        if(T%8==6||T%8==2)
            cout<<"yes"<<endl;
        else cout<<"no"<<endl;
   }
    return 0;
}