[백준] 11727번 2xn 타일링 2 (silver 3

#include <iostream>
using namespace std;

int main() {
	int n;
	cin >> n;
	int dp[1001];

	dp[1] = 1;
	dp[2] = 3;
	for (int i = 3; i <= n; i++) {
		if (i % 2 == 1) {
			dp[i] = (dp[i - 1] * 2 - 1) % 10007;
		}
		else {
			dp[i] = (dp[i - 1] * 2 + 1) % 10007;
		}
	}
	cout << dp[n] << endl;
	return 0;
}