hNCJqe - Online Java Compiler & Debugging Tool

import java.util.Scanner;

public class Main {
    public static int fibonacci(int n) {
        if (n <= 0) {
            return 0;
        }
        if (n == 1) {
            return 1;
        }

        int f0 = 0;
        int f1 = 1;
        int fibo = 0;

        // The C++ code calculates n steps starting from the 0th term (f0=0, f1=1).
        // To correctly calculate the nth Fibonacci number F(n), we need n-1 steps
        // starting from F(1). The original code returns F(n) at the end of the loop,
        // but the logic is slightly off. The standard iterative approach is safer.
        // We'll use the safer standard iterative loop for F(n).

        for (int i = 2; i <= n; i++) {
            fibo = f0 + f1;
            f0 = f1;
            f1 = fibo;
        }

        return f1;
    }

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

        int n = scanner.nextInt();

        System.out.println(fibonacci(n));

        scanner.close();
    }
}