// D test program fib.d  CSE413 6/99, rev 5/00

// Read k and print the kth fibonocci number, recursively


// = nth fibonocci number
int fib(int n)
{
  if (n == 0)
   return 0;
  else if (n == 1)
    return 1;
  else 
   return (fib(n-1) + fib(n-2));
}

int main()
{
  int x;
  int output;
 
  x = get();
  output = fib(x);
  output = put(output);
  return 0-1-1;
}