Fi数列

Fi数列，其中F(0)=7,F(1)=11,F(n)=F(n-1)+F(n-2)n>=2
n<1000000
问Fn的结果是否能被3整除
Sample Input
0
1
2
3
4
5
Sample Output
no
no
yes
no
no
no

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner sc = new Scanner(System.in);
        while (sc.hasNext()) {
            int n = sc.nextInt();
            if ((n-2)%4==0) {
                System.out.println("yes");
            }else {
                System.out.println("no");
            }
        }
    }

}

简单列举就可以知道规律了！