int fib(int n){
  int old = 1;
  int new = 1;
  int i = 1;
  while(i < n){
    int newnew = old + new;
    old = new;
    new = newnew;
    i = i + 1;
  }
  return new;
}