#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <algorithm>
#include <numeric>
#include <queue>
using namespace std;

const int mod = 1000000007;
struct mint {
  typedef long long ll;
  ll x;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
  mint operator+(const mint a) const { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }

  // for prime mod
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint a) { return *this *= a.inv();}
  mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}

mint dp[1000010][2][10] = {};
int main() {
  int n;
  cin >> n;
  string x;
  for (int i = 0; i < n; i++) x.push_back('9');
  dp[0][0][0] = 1;
  for (int i = 0; i < n; i++) {
    int d = x[i]-'0';
    for (int j = 0; j < 2; j++) {
      for (int k = 0; k < 10; k++) {
        for (int l = 0; l <= (j ? 9 : d); l++) {
          if (l >= k) dp[i+1][j || (l < d)][l] += dp[i][j][k];
        }
      }
    }
  }
  mint ans = 0;
  for (int j = 0; j < 2; j++)
    for (int k = 0; k < 10; k++)
      ans += dp[n][j][k];
  
  cout << ans << endl;
  
}