// Given the value of N , find the Nth Fibonacci Number 

import java.util.*;
import java.lang.*;
import java.io.*;

// The main method must be in a class named "Main".
class Main {

    //Iterative Approach
    public static int fibonacciiterative(int N){  // Main problem
        //Base Case
        if(N == 0 || N == 1){
            return N ;
        }
        int first = 0;
        int second = 1;

        for (int i = 2; i <= N ; i++) {
            int next = first + second;
            first = second;
            second = next;
        }

        return second;
    }

    //Recursive Approach
    public static int fibonacciReucrsive(int N ){
        //Base Condition 
        if(N==0 || N== 1){
            return N ;
        }
        int a = fibonacciReucrsive(N-1);
        int b = fibonacciReucrsive(N-2);
        return a+b;
    }

    public static void main(String[] args) {
        int N = 10; 
        System.out.println("Fibonacci(" + N + ") in iterative approach = " + fibonacciiterative(N));
        System.out.println("Fibonacci(" + N + ") in Recursive approach = " + fibonacciReucrsive(N));
    }
}