int Fibo(int n){
 int a = 1, b = 1, s, nr = 2;
 while (nr < n){
  s = a + b;
  if (s % 2 == 1)
      nr++;
  a = b;
  b = s;	}
 return s;	}