F(0)=0;
F(1)=1;
F(n)=F(n-1)+F(n-2);
public class Fibonacci {
public static int fibonacci(int n){
if(n == 0){
return 0;
}else if(n == 1){
return 1;
}
return fibonacci(n - 1) + fibonacci(n - 2);
}
public static void main(String[] args){
System.out.print(fibonacci(8));
}
}