public class Fibonocci {
    
    public Fibonocci() {
    }
    public static int fibo(int n){
        if(n>1)
            n=fibo(n-1)+fibo(n-2);
        return n;
    }
    public static int fibono(int n){
        int i=0,j=1,s=0;
        for(int k=0;k<n-1;k++){
            s=i+j;
            i=j;
            j=s;
        }
        return s;
    }
    public static void main(String[] args) {
        int n=8;
        System.out.print(fibo(n)+"\n"+ fibono(n));
    }
    
}