class BigO
{
    public static long count = 0L;
    
    public static long fibR(long n)
    {   
        count++;
	    if(n == 1 || n ==2)
		    return 1L;
	    else
		    return fibR(n-1) + fibR(n-2);
    }
    
    public static long fibI(long n)
    {
	    long oldest = 1L;
	    long old = 1L;
	    long fib = 1L;
	    count = 2L;
	    while(n-- > 2L) {
	        count++;
		    fib = old + oldest;
		    oldest = old;
		    old = fib;
	    }
	    return fib;
    }
    
    public static void main(String args[])
    {
        if(args.length == 2)
        {
            long n = Long.parseLong(args[1]);
            if(args[0].equals("i"))
            {
                System.out.println(fibI(n));
                
            }
            else
            {
                System.out.println(fibR(n));
            }
            System.out.println("Count = " + count);
        }
        else
        {
            System.out.println("Error should be: java BigO i|r n");
        }
        
        
    }
}