//斐波那契数列
import java.util.Scanner;
public class Fibonacci{
public static int f(int n){
if(n <= 0){
System.out.println("输入有误,n为大于0的数!");
return -1;
}else if(n == 1||n == 2){
return 1;
}else{
return f(n-1)+f(n-2);
}
}
public static void main(String[] args){
System.out.println("你想直到斐波那契数列的第几项?");
Scanner input = new Scanner(System.in);
int n = input.nestIn();
System.out.println("数列的第n项值为:" + f(n));
}
}