#include<bits/stdc++.h>
using namespace std;
using ll = long long;

ll mod = 1000000007;

int main(){
    ll N; cin >> N;
    vector<vector<vector<ll>>> dp(N + 2, vector<vector<ll>>(2, vector<ll>(10, 0)));
    dp[1][1][0] = 1; dp[1][0][1] = 1;
    for(int i = 1; i <= N; i++){
        for(int j = 0; j <= 9; j++)for(int k = j; k <= 9; k++){
            dp[i + 1][1][k] = (dp[i + 1][1][k] + dp[i][1][j]) % mod;
            if(k == 0)dp[i + 1][0][k] += dp[i][0][j];
        }
    }
    ll cnt = 0;
    for(int i = 0; i <= 9; i++)cnt = (cnt + dp[N + 1][1][i]) % mod;
    cout << cnt << endl;
}