/*
  non-recursive solution to the fibonacci sequence
*/

#include <stdio.h>

int fibo(int n);

int main() {
  int n = 33;
 
  //printf("Enter your value: ");
  //scanf("%d", &n);
  printf("fibo(%d) = %d\n", n, fibo(n-1));
  
  return 0;
}

int fibo(int n) {
  int i;
  int first = 0;
  int second = 1;
  int sum = 1;

  for (i = 0; i < n; i++) {
    sum = first + second;
    first = second;
    second = sum;
  }

  return sum;
}