HDU 1021 Fibonacci Again

Description

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

 

Input

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

 

Output

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

Print the word "no" if not. 

 

Sample Input

012345 

 

Sample Output

nonoyesnonono 

公式： (a+b)%k = (a%k + b%k)%k

　　　 (a-b)%k = (a%k - b%k)%k

#include <stdio.h>int main() {int n;while (scanf("%d", &n) == 1) {if (n == 1 || n == 0) {printf("no\n");continue;}if ((n - 2) % 4 == 0)printf("yes\n");elseprintf("no\n");}return 0;}