[11726번] 2n 타일링

#include 

using namespace std;

int n, ans;
int dp[1001];

int main() {
	cin >> n;
	dp[1] = 1;
	dp[2] = 2;
	for (int i = 3; i <= n; i++) {
		dp[i] = (dp[i - 1] + dp[i - 2])%10007;
	}
	cout << dp[n];

	return 0;
}