#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// #define int long long
// #define double long double
#define rep(i,n) for (int i=0; i<(int)(n); ++i)
#define rep1(i,n) for (int i=1; i<(int)(n); ++i)
#define repeq(i,n) for (int i=0; i<=(int)(n); ++i)
#define rep1eq(i,n) for (int i=1; i<=(int)(n); ++i)
#define rrep(i,n) for (int i=(int)(n)-1; i>=0; --i)
#define rrep1(i,n) for (int i=(int)(n)-1; i>0; --i)
#define rrepeq(i,n) for (int i=(int)(n); i>=0; --i)
#define rrep1eq(i,n) for (int i=(int)(n); i>0; --i)
#define REP(i,a,b) for (int i=(int)(a); i<=(int)(b); ++i)
#define RREP(i,a,b) for (int i=(int)(a); i>=(int)(b); --i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
template<typename T> using Graph = vector<vector<T>>;
template<typename T> using Spacial = vector<vector<vector<T>>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
string interval[2] = {" ", "\n"}; // {" ", "\n"}
const int MOD = 1e9+7;
const int MOD2 = 998244353;
// const double EPS = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

template<typename T> struct is_plural : false_type{};
template<typename T1, typename T2> struct is_plural<pair<T1, T2>> : true_type{};
template<typename T> struct is_plural<vector<T>> : true_type{};
template<typename T> struct is_plural<complex<T>> : true_type{};

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << " " << p.second; }
template<typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto itr = vec.begin(); itr != vec.end(); ++itr) is >> *itr; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { if (vec.empty()) return os; bool pl = is_plural<T>(); os << vec.front(); for (auto itr = ++vec.begin(); itr != vec.end(); ++itr) os << interval[pl] << *itr; return os; }

bool CoutYN(bool a, string y = "Yes", string n = "No") { cout << (a ? y : n) << "\n"; return a; }

template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

long long modpow(int a, long long n, int mod = MOD) { long long ret = 1; do { if (n & 1) ret = ret * a % mod; a = 1LL * a * a % mod; } while (n >>= 1); return ret; }

template<typename T> T GCD(T a, T b) { return b ? GCD(b, a%b) : a; }
template<typename T> T LCM(T a, T b) { return a / GCD(a, b) * b; }

template<typename T1, typename T2> bool CompareBySecond(pair<T1, T2> a, pair<T1, T2> b) { return a.second != b.second ? a.second < b.second : a.first < b.first; }
// counterclockwise from 12 o'clock direction
template<typename T> bool CompareBySlope(pair<T, T> a, pair<T, T> b) { if (a.first * b.first < 0) return a.first < b.first; if (a.first == 0) return a.second >= 0 || b.first > 0; if (b.first == 0) return b.second < 0 && a.first < 0; return a.second * b.first < a.first * b.second; }


/* -------- <templates end> -------- */


template<typename T>
vector<pair<T, int>> prime_factor(T num) {
  vector<pair<T, int>> ret;
  for (T i=2; i*i<=num; ++i) {
    int cnt = 0;
    while (num%i == 0) {
      num /= i;
      ++cnt;
    }
    if (cnt != 0) ret.emplace_back(i, cnt);
  }
  if (num != 1) ret.emplace_back(num, 1);
  return ret;
}

template<typename T>
vector<T> divisor(vector<pair<T, int>> &pf, int rev) {
  vector<T> ret;
  ret.emplace_back(1);
  for (auto &p : pf) {
    int sz = ret.size();
    T x; int y;
    tie(x,y) = p;
    for (int i=0; i<sz; ++i) {
      T d = ret[i];
      for (int j=0; j<y; ++j) {
        d *= x;
        ret.emplace_back(d);
      }
    }
  }
  if (rev > 0) sort(ret.begin(), ret.end());
  else if (rev < 0) sort(ret.rbegin(), ret.rend());
  return ret;
}

template<typename T>
vector<T> divisor(T &num, int rev) {
  auto &&pf = prime_factor(num);
  return divisor(pf, rev);
}

void solve() {
  int s; cin >> s;
  auto div = divisor(s, 1);

  int over7 = s/8;
  auto itr = upper_bound(ALL(div), over7);
  ll ans = over7 - (itr - div.begin());

  for (auto sitr=div.begin(); sitr!=itr; ++sitr) {
    int digit = s / *sitr;
    ans += 9 * modpow(10, digit-1) + MOD - (*sitr - 1);
  }

  vl cnt(8);
  cnt[0] = 9;
  rep1(i,8) cnt[i] = cnt[i-1] * 10;
  
  for (auto sitr=itr; sitr!=div.end(); ++sitr) {
    int digit = s / *sitr;
    if (cnt[digit-1] < *sitr) break;
    ans += cnt[digit-1] - (*sitr - 1);
  }

  rep(j,8) {
    rep(i,j) {
      int res = s;
      REP(k,i+1,j-1) res -= cnt[k] * (k+1);
      if (res - (i+1) - (j+1) < 0 || res > cnt[i] * (i+1) + cnt[j] * (j+1)) continue;

      int gcd = GCD(i+1, j+1);
      if (res % gcd) continue;

      res -= (i+1) + (j+1);
      int mod = res % (j+1);
      int left = 0;

      while (mod) {
        mod -= i+1;
        if (mod < 0) mod += j+1;
        ++left;
      }

      int right = (res - left * (i+1)) / (j+1);
      if (right < 0) continue;

      int tmp = cnt[j] - 1;
      if (right > tmp) {
        right -= ((right - tmp - 1) / (i+1) + 1) * (i+1);
        left = (res - right * (j+1)) / (i+1);
      }
      if (left > cnt[i] - 1) continue;

      int di = (i+1) / gcd, dj = (j+1) / gcd;

      ans += min(right / di + 1LL, (cnt[i] - 1 - left) / dj + 1);
    }
  }

  cout << ans % MOD << endl;
}


/* -------- <programs end> -------- */


signed main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  solve();
  return 0;
}


Measured memory_bytes: 256