Fibonacci数列

/**
 * Fibonacci数列的递推公式为：Fn=Fn-1+Fn-2，其中F1=F2=1。
 * 求Fn除以10007的余数是多少
 */
import java.util.*;
public class Fibonacci数列 {
public static void main(String[] args) {
Scanner in=new Scanner(System.in);

int n =in.nextInt() ;

int[] a = new int[n+2] ;
a[1] = a[2] = 1;
if (n == 1) {
a[n] = 1 ;
}else if (n == 2) {
a[n] = 1 ;
}else {
for (int i = 3; i <= n; i++) {
a[i] = (a[i - 1] + a[i - 2]) % 10007 ;
}
}
System.out.println(a[n]);
}
}