BOJ)11727 2xn 타일링 2

#include <iostream>
using namespace std;
 
int main()
{
    int dp[1001];
    dp[1] = 1;
    dp[2] = 3;
    int n;
    cin >> n;
    for (int i = 3; i <= n; i++) {
        dp[i] = (2 * dp[i - 2] + dp[i - 1]) % 10007;
    }
    
    cout << dp[n];
    return 0;
}