/*
DATE:4/11/2008
AUTHOR: M DEEPAK
BUGS TO: mdeepak@cse.iitk.ac.in
*/
/*1. Design a recursive method to compute nth Fibonacci number. Use it in a
program to compute first n Fibonacci numbers. The value of n is provided from command
line.
*/
class Fibonacci{
	
		public static void main(String args[]){
			
			int n=0;
			
			try{				
				n=Integer.parseInt(args[0]);
			}catch(Exception e){
				
				System.out.println("Please Enter a number as argument");
				System.exit(0);
			}
			
			System.out.println("The number entered="+n);
			
			for(int i=1;i<=n;i++)
				System.out.println("Fibonacci-"+i+"="+Fib(i));
			
		}
		public static int Fib(int n){
			
			if((n==1)||(n==2))
				return 1;
				
		    else
		    	return Fib(n-1)+Fib(n-2);
		    	
		}
}