Java

Why this recursive method does not work for big numbers? Currently, this method can find till the 45th Fibonacci number. How can I make it work for example to find The 100th Fibonacci number or even bigger?

public static BigInteger Fibonacci(int n) { if (n == 0) // Base case return BigInteger.ZERO; else if (n == 1) // Base case return BigInteger.ONE; else return Fibonacci(n-1).add(Fibonacci(n-2)); }