import java.util.Scanner; public class Fibonacci { { int banyak = input.nextInt(); for (int i = 1; i <= banyak; i++) { } } public static int fibonaccirekursi(int n) { if (n == 1 || n == 2) { return 1; } return fibonaccirekursi(n-1) + fibonaccirekursi(n-2); } }