Recursive Fibonacci Method

Consider the following program. What value is printed when it is executed?

public class Fibonacci {
    public static int fib(int n) {
        if(n <= 1)
            return n;
        return fib(n - 1) + fib(n - 2);
    }
    public static void main(String[] args) {
        System.out.println(fib(4));
    }
}