public class Fibonacci
{
  public static void main(String args[]){
    if(args.length == 1)
      System.out.println( fib_recurse(Integer.parseInt(args[0])) );
  }
  
  static int fib_recurse(int input){
    // Terminating condition
    if(input == 0 || input == 1)
      return input;
    
    // The reccurence.
    return fib_recurse(input - 1) + fib_recurse(input - 2);
  }
}