Fibonacci Again

描述
There are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2).
输入
Input consists of a sequence of lines, each containing an integer n. (n < 1,000,000).
输出
Print the word "yes" if 3 divide evenly into F(n).

Print the word "no" if not.
样例
样例输入 #1
0
1
2
3
4
5
样例输出 #1
no
no
yes
no
no
no
HDOJ-1021
题目来源:HDOJ-1021
时间限制:1000 MS
内存限制:32768 KB
Java 类名:Main
64 位整数占位符:%I64d