描述:
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.
翻译:有其他类型的斐波那契数:F(0)=7,F(1)=11,F(n)=F(n-1)+F(n-2)(n>=2).
输入:输入有连续几行,每行包括1个整数.
输出:当3平均分配给F(n)时,打印yes.如果不是打印no.