HDU 1021 Fibonacci Again

Description

There is another kind of Fibonacci numbers:f (0) = 7, f (1) = one, 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

Fibonacci General Judge Yes,no time to pay attention to whether you can find the law on the line.

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

int main ()
{
    int a[8];
    A[0] = 1;
    A[1] = 2;
    A[2] = 0;
    A[3] = 2;
    A[4] = 2;
    A[5] = 1;
    A[6] = 0;
    A[7] = 1;
    int n;
    while (Cin>>n)
    {
        if (a[n%8]==0)
            printf ("yes\n");
        else
            printf ("no\n");
    }
}