http://acm.hdu.edu.cn/showproblem.php?pid=1021
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<bitset>
#include<iomanip>
using namespace std;
#define MAX 1000005
int F[ MAX ] ;
void solve()
{
int i ;
F[ 0 ] = 7 % 3 ;
F[ 1 ] = 11 % 3 ;
for( i = 2 ; i <= 1000000; ++i )
{
F[ i ] = ( F[ i - 1 ] % 3 + F[ i - 2 ] % 3 ) % 3 ;
}
}
int main()
{
int n ;
solve() ;
while( scanf( "%d" , &n ) != EOF )
{
if( !F[ n ] )
printf( "yes\n" ) ;
else
printf( "no\n" ) ;
}
return 0 ;
}