HDU 1021 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

import java.util.Scanner;public class Main {    public static void main(String[] args) {        Scanner sc = new Scanner(System.in);        while (sc.hasNext()) {            int x = sc.nextInt();            switch (x % 4) {            case 0:            case 1:            case 3:                System.out.println("no");                break;            case 2:                System.out.println("yes");                break;            default:                break;            }        }        sc.close();    }}