// Copyright 2005 Daniel Cer (daniel.cer@cs.colorado.edu)
//
// This work is licensed under the Creative Commons Attribution-NonCommercial-
// ShareAlike License. To view a copy of this license, visit 
// http://creativecommons.org/licenses/by-nc-sa/2.5/ or send a letter to 
// Creative Commons, 543 Howard Street, 5th Floor, San Francisco, California, 
// 94105, USA.

#include <iostream>

using namespace std;

int fibonacci(int n) {
  if (n <= 0) return -1; if (n <= 2) return 1;
  return fibonacci(n-1) + fibonacci(n-2); 
}

int main(int argc, char *argv[]) {
  if (argc != 2) {
     cerr<<"Usage:\n\t"<<argv[0]<<" (n-th Fibonacci # to calculate)"<<endl;  
     return -1;
  }
  int n = atoi(argv[1]);
  cout<<"fibonacci("<<n<<"): "<<fibonacci(n)<<endl;
  return 0;
}