Problem 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
#include
using namespace std;
int main(){
int n;
while(cin>>n){
if(n%4==2) cout