public class fibonacci{

    public static int Fibonacci(int n){

        // base case:
        if(n <= 1) return 1;

        // rekursive kallet:
        return Fibonacci(n - 1) + Fibonacci(n - 2);
    }


    public static void main(String[] args) {
        System.out.println(Fibonacci(15));;
    }
}