long long fib(long long n){ //recursion
if(n < 1) return -1;
if(n == 1 || n == 2) return 1;
else return fib(n-1) + fib(n-2);
}
long long fib1(long long n){//iterative
if(n < 1) return -1;
if(n == 1 || n == 2) return 1;
long long a = 1, b = 1;
for(long long i = 3; i <= n; ++i){
long long c = a + b;
a = b;
b = c;
}
return b;
}