package recursion;

public class Fibonacci 
{
    public int fibonacci(int first, int second)
    {   if (first > 1000) return first + second;
        int next = first + second;
        System.out.print(next + " ");
        System.out.println((double)next / second);
        return fibonacci(second, next);
    }
    public static void main(String[] args) 
    {   Fibonacci f = new Fibonacci();
        System.out.print("1 1 ");
        int result = f.fibonacci(1, 1);        
        System.out.println(result);
    }
}