1201：Fibonacci Again

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

012345

 

 

Sample Output

nonoyesnonono
code：
#include <stdio.h>
int ar[8]={0,0,1,0,0,0,1,0};
int main()
{
 int n;
 while(scanf("%d",&n)==1)
 {
  if(ar[n%8])
   printf("yes/n");
  else
   printf("no/n");
 }
    return 0;
}