function solution(n) {
if(n === 2) return 1;
let fibo = [1,1];
let i = 3;
while(i <= n){
let zero = fibo[0];
fibo[0] = fibo[1] % 1234567;
fibo[1] = (zero + fibo[1]) % 1234567;
if(i === n) return fibo[1] % 1234567 ;
i++;
}
}