#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
ll dp[1000005][10];
int main() {
    int N;
    cin >> N;
    dp[0][0] = 1;
    for (int i = 1; i <= N; i++) {
        for (int j = 0; j < 10; j++) {
            for (int d = 0; d < 10; d++) {
                if (d <= j) {
                    dp[i][j] += dp[i - 1][d];
                    dp[i][j] %= mod;
                }
            }
        }
    }
    ll ans = 0;
    for (int i = 0; i < 10; i++) {
        ans += dp[N][i];
        ans %= mod;
    }
    cout << ans << endl;
    return 0;
}