非AC代码,时间超时,因此我们在准备蓝桥或者ACM时尤其注意培养!!!
/*method 1: !AC
#include<iostream>
using namespace std;
int Fibonacci(int n){
if(n==0)
return 7;
else if(n==1)
return 11;
else
return Fibonacci(n-1)+Fibonacci(n-2);
}
int main(){
int n;
while(scanf("%d",&n)!=EOF)
if(Fibonacci(n)%3==0)
cout<<"yes"<<endl;
else
cout<<"no"<<endl;
} */
//method 2; AC
#include<iostream>
using namespace std;
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
if((n-2)%4!=0)
cout<<"no"<<endl;
else
cout<<"yes"<<endl;
}
//method 3: AC
/*
#include<iostream>
using namespace std;
int a[1000100];
int main(){
int n;
a[0]=7,a[1]=11;
while(scanf("%d",&n)!=EOF){
for(int i=2;i<=n;i++)
a[i]=(a[i-1]+a[i-2])%3;
if(a[n]%3==0)
cout<<"yes"<<endl;
else
cout<<"no"<<endl;
}
}*/