Migrated from Lutece 1008 Fibonacci Again

All parts of this problem, including description, images, samples, data and checker, might be broken. If you find bugs in this problem, please contact the admins.

Description

There are another kind of Fibonacci numbers: $F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n \geq 2)$.

Input

Input consists of a sequence of lines, each containing an integer $n$. $(n < 1,000,000,000)$.

Output

Print the word yes if $3$ divide evenly into $F(n)$.

Print the word no if not.

Samples

0
1
2
3
4
5

no
no
yes
no
no
no

Resources

HDU