Fibonacci Again

时间限制: 1000 ms 内存限制: 65536 kb
总通过人数: 15 总提交人数: 21

题目描述

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.

输入样例

0
1
2
3
4
5

输出样例

no
no
yes
no
no
no

相关推荐