package nunber2;
import java.util.*;
public class Demo {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int[] nums=new int[n+2];
nums[1]=1;
nums[2]=1;
System.out.println(fibonacci(n,nums));
}
public static int fibonacci(int n,int[]nums) {
if(n>=3) {
for (int i = 3; i <= n; i++) {
nums[i]=(nums[i-1]+nums[i-2])%10007;
}
}
return nums[n];
}
}
03-15
1567