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

012345

Sample Output

nonoyesnonono解题报告：这是道规律题，列出20个结果找规律即可。code：
#include<iostream>#include<algorithm>#include<stdio.h>#include<queue>#include<math.h>#include<string.h>#include<stdlib.h>using namespace std;typedef long long ll;int main(){//    freopen("input.txt","r",stdin);    int n;    while(cin>>n){        if(n<2)            cout<<"no"<<endl;        else if(n==2)            cout<<"yes"<<endl;        else{            if(n%4==2)                cout<<"yes"<<endl;            else                cout<<"no"<<endl;        }    }    return 0;}