HDU-ACM1021

Fibonacci Again

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 50859    Accepted Submission(s): 24076

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
  
  

 

Sample Output

  
  

   
   no
no
yes
no
no
no
  
  

import java.util.Scanner;

class Main{
    public static void main(String[] args) {
        Scanner input=new Scanner(System.in);
        while (input.hasNext()){
        	int n=input.nextInt();
        	int arr[]={1,2,0,2,2,1,0,1};
        	if (arr[n%8]==0){
        		System.out.println("yes");
        	}else {
        		System.out.println("no");
        	}
        }
    }
}