#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
long long dp[101010][10][2];

int main()
{
    long long N;
    cin >> N;
    char S[N];
    for (int i = 0; i < N; i++)
    {
        S[i] = '9';
    }
    dp[0][0][0] = 1;

    for (int i = 1; i <= N; i++)
    {
        int n = S[i - 1] - '0';
        // smaller -> smaller
        for (int j = 0; j < 10; j++)
        {
            for (int k = j; k < 10; k++)
            {
                dp[i][k][1] += dp[i - 1][j][1];
                dp[i][k][1] %= MOD;
            }
        }
        // not smaller -> smaller
        for (int j = 0; j < 10; j++)
        {
            for (int k = j; k < n; k++)
            {
                dp[i][k][1] += dp[i - 1][j][0];
                dp[i][k][1] %= MOD;
            }
        }
        // not smaller -> not smaller
        for (int j = 0; j < 10; j++)
        {
            if (n >= j)
            {

                dp[i][n][0] += dp[i - 1][j][0];
                dp[i][n][0] %= MOD;
            }
        }
    }
    long long ans = 0;
    for (int i = 0; i < 10; i++)
    {
        for (int j = 0; j < 2; j++)
        {
            ans += dp[N][i][j];
            ans %= MOD;
        }
    }
    cout << ans << endl;
}