#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,m,n) for(int i=m; i<int(n); ++i)
#define repll(i,m,n) for(ll i=m; i<ll(n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define fi first
#define se second

template<typename T> bool chmin(T& a, T b){ if(a > b){a = b; return true;} return false; }
template<typename T> bool chmax(T& a, T b){ if(a < b){a = b; return true;} return false; }

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N;
    cin >> N;
    string M(N, '9');

    const int mod = 1e9 + 7;
    vector dp(N+1, vector(10, vector(2, 0)));
    dp[0][0][1] = 1;

    rep(i, 0, N){
        rep(d, 0, 10){
            rep(small, 0, 2){
                rep(nxt, d, 10){
                    if(small){
                        dp[i+1][nxt][small] += dp[i][d][small];
                        dp[i+1][nxt][small] %= mod;
                    }
                }
            }
        }
    }

    int ans = 0;
    rep(d, 0, 10){
        ans += dp[N][d][1];
        ans %= mod;
    }
    cout << ans << endl;

    return 0;
}