2C. Fibonacci Again

2C. Fibonacci Again

Time Limit: 1000ms

Case Time Limit: 1000ms

Memory Limit: 32768KB

 

64-bit integer IO format: %I64d      Java class name: Main

 

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


规律是:no no yes no

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#define LL long long
using namespace std;
int main(){
    int n;
    while(~scanf("%d",&n)){
        n%4 == 2 ? puts("yes"):puts("no");
    }
    return 0;
}