There are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2).
#include <iostream>
#include <cstdio>
const int N=1000000+5;
using namespace std;
long long f[N];
int main()
{
int n;
f[0]=7%3;
f[1]=11%3;
for(int i=2;i<=1000000;i++)
f[i]=(f[i-1]+f[i-2])%3;
while(scanf("%d",&n)!=EOF)
{
if(f[n]==0)
printf("yes\n");
else
printf("no\n");
}
return 0;
}