#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
using namespace std;
const int MOD = 1e9 + 7;

int main() {
    int N;
    cin >> N;
    vector<vector<ll>> dp(N + 1, vector<ll>(10));

    rep(i, 10) dp[1][i] = 1;
    for (int i = 2; i <= N; ++i) {
        ll cur = 0;
        rep(j, 10) {
            cur += dp[i - 1][j];
            cur %= MOD;

            dp[i][j] += cur;
            dp[i][j] %= MOD;
        }
    }

    ll ans = accumulate(dp[N].begin(), dp[N].end(), 0LL);
    ans %= MOD;
    cout << ans << endl;

    return 0;
}