#include <algorithm>
#include <iostream>
#include <string>
#include <vector>

using namespace std;
using ll = long long int;
const ll MOD = 1e9 + 7;

ll DP[10000001][10][2] = {};

ll count(const vector<ll> N) {
  DP[0][0][0] = 1;

  for (size_t i = 0; i < N.size(); i++) {
    for (size_t d = 0; d < 10; d++) {
      for (size_t k = 0; k < 10; k++) {
        for (size_t l = 0; l < 2; l++) {
          if (l == 0 && N[i] < d) {
            continue;
          }
          if (k > d) {
            continue;
          }
          int nk = max(d, k);
          int nl = (N[i] > d) ? 1 : l;
          DP[i + 1][nk][nl] += DP[i][k][l];
          DP[i + 1][nk][nl] %= MOD;
        }
      }
    }
  }
  ll sum = 0;
  for (size_t k = 0; k < 10; k++)
  {
    sum += DP[N.size()][k][0];
    sum += DP[N.size()][k][1];
    sum %= MOD;
  }
  return sum;
}

int main() {
  ll n;
  cin >> n;

  auto ToVec = [](string s) {
    vector<ll> vec;

    for (auto &&e : s) {
      vec.push_back(e - '0');
    }

    return vec;
  };

  vector<ll> N;
  for (size_t _ = 0; _ < n; _++) {
    N.push_back(9);
  }

  cout << count(N) << endl;
}