FibonacciZnacci

import java.util.Scanner;

public class _03_RecursiveFibonacci {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int wantedFibonacciNum = Integer.parseInt(scanner.nextLine());
        int[] arrFibonacci = new int[wantedFibonacciNum];

        int result = 0;
        for (int i = 0; i < arrFibonacci.length; i++) {
            if (i == 0 || i == 1) {
                arrFibonacci[i] = 1;
            } else {
                arrFibonacci[i] = arrFibonacci[i - 1] + arrFibonacci[i - 2];
            }
            result = arrFibonacci[arrFibonacci.length-1];
        }
        System.out.println(result);
    }
}