#include <bits/stdc++.h>
using namespace std;
using LL = long long;
const LL MOD = 1e9 + 7;
const LL UPPER = 1e6 + 1;

LL dp[UPPER][10];

int main() {
    
    // 1. 入力情報取得.
    LL N;
    cin >> N;
    
    // 2. AscNumberの数え上げ(DP使用).
    // -> 下記サイトも参照.
    // A000581 Binomial coefficients C(n,8).
    // https://oeis.org/A000581
    for(LL i = 0; i <= 9; i++) dp[0][i] = 1;
    for(LL i = 1; i <= N; i++){
        dp[i][0] = dp[i - 1][0], dp[i][0] %= MOD;
        dp[i][1] = dp[i][0] + dp[i - 1][1], dp[i][1] %= MOD;
        dp[i][2] = dp[i][1] + dp[i - 1][2], dp[i][2] %= MOD;
        dp[i][3] = dp[i][2] + dp[i - 1][3], dp[i][3] %= MOD;
        dp[i][4] = dp[i][3] + dp[i - 1][4], dp[i][4] %= MOD;
        dp[i][5] = dp[i][4] + dp[i - 1][5], dp[i][5] %= MOD;
        dp[i][6] = dp[i][5] + dp[i - 1][6], dp[i][6] %= MOD;
        dp[i][7] = dp[i][6] + dp[i - 1][7], dp[i][7] %= MOD;
        dp[i][8] = dp[i][7] + dp[i - 1][8], dp[i][8] %= MOD;
    }
    
    // for(LL i = 0; i <= N; i++){
    //     for(LL j = 0; j < 10; j++) cout << dp[i][j] << " ";
    //     cout << endl;
    // }
    
    // 3. 集計.
    LL ans = 0;
    for(LL i = 0; i <= N; i++) ans += dp[i][8], ans %= MOD;

    // 4. 出力.
    // ex.
    // N = 1000000 -> 587204484 でOK?
    cout << ans << endl;
    return 0;
    
}