@@ -0,0 +1,669 @@
+import java.io.*;%0Aimport java.util.*;%0Aimport java.text.*;%0Aimport java.math.*;%0Aimport java.util.regex.*;%0A%0Apublic class FibonacciReturns %7B%0A%0A    public static void main(String%5B%5D args) %7B%0A        Scanner in = new Scanner(System.in);%0A        while(in.hasNext()) %7B%0A        int n=in.nextInt();%0A        if (n==0) %7B%0A            System.out.println(0);%0A        %7D else %7B%0A            System.out.println(calculateFibonacci(BigInteger.ZERO, BigInteger.ONE, n-1));%0A        %7D%0A        %7D%0A        in.close();%0A    %7D%0A    %0A    static BigInteger calculateFibonacci (BigInteger n1, BigInteger n2, int limit) %7B%0A%09%09if (limit%3E0) return calculateFibonacci(n2, n1.add(n2), --limit);%0A%09%09return n2;%0A%09%7D%0A%7D%0A

Create FibonacciReturns.java