package 蓝桥基础;
import java.util.Scanner;
public class 斐波那契的数列1 {
public static void main(String []args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int num[] = new int[10000000];
num[0] = 1;
num[1] = 1;
for(int i = 2; i <= n; i++) {
num[i]=(num[i-1]+num[i-2])%10007;
}
System.out.println(num[n-1]);
}
}
//输入的n决定了能加和加到哪
//斐波那契数列 1 1 2 3 5 8 13 21
//要求输出的是 第n个数对10007进行取余