#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
typedef pair<db,db> pd;

typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<ll> vl;
typedef vector<db> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<pd> vpd;

#define mp make_pair
#define f first
#define s second
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define sor(x) sort(all(x))
#define rsz resize
#define resz resize
#define ins insert
#define ft front()
#define bk back()
#define pf push_front
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound

#define f1r(i, a, b) for(int i = (a); i < (b); ++i)
#define f0r(i, a) f1r(i, 0, a)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i,0,a)
#define ROF(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i, a) ROF(i, 0, a)
#define trav(a, x) for (auto& a: x)

mt19937 rng((uint32_t) chrono::steady_clock::now().time_since_epoch().count());
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
constexpr int pct(int x) { return __builtin_popcount(x); }
constexpr int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x))

namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);
    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class T, class... Ts> void re(T& t, Ts&... ts) {
        re(t); re(ts...); }
    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}

using namespace input;

namespace output {
    void pr(int x) { cout << x; }
    void pr(long x) { cout << x; }
    void pr(ll x) { cout << x; }
    void pr(unsigned x) { cout << x; }
    void pr(unsigned long x) { cout << x; }
    void pr(unsigned long long x) { cout << x; }
    void pr(float x) { cout << x; }
    void pr(double x) { cout << x; }
    void pr(ld x) { cout << x; }
    void pr(char x) { cout << x; }
    void pr(const char* x) { cout << x; }
    void pr(const string& x) { cout << x; }
    void pr(bool x) { pr(x ? "true" : "false"); }
    template<class T> void pr(const complex<T>& x) { cout << x; }
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T> void pr(const T& x);
    template<class T, class... Ts> void pr(const T& t, const Ts&... ts) {
        pr(t); pr(ts...); }
    template<class T1, class T2> void pr(const pair<T1,T2>& x) {
        pr("{",x.f,", ",x.s,"}"); }
    template<class T> void pr(const T& x) {
        pr("{"); // const iterator needed for vector<bool>
        bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0;
        pr("}"); }
    void ps() { pr("\n"); } // print w/ spaces
    template<class T, class... Ts> void ps(const T& t, const Ts&... ts) {
        pr(t); if (sizeof...(ts)) pr(" "); ps(ts...); }
    void pc() { pr("]\n"); } // debug w/ commas
    template<class T, class... Ts> void pc(const T& t, const Ts&... ts) {
        pr(t); if (sizeof...(ts)) pr(", "); pc(ts...); }
}

using namespace output;

namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        cin.sync_with_stdio(0); cin.tie(0); // fast I/O
        // cin.exceptions(cin.failbit); // ex. throws exception when you try to read letter into int
        if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
    }
}

using namespace io;

// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
	cerr << ts(h); if (sizeof...(t)) cerr << ", ";
	DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL, chk -> fake assert
	#define dbg(...) cerr << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
	#define chk(...) if (!(__VA_ARGS__)) cerr << "Line(" << __LINE__ << ") -> function(" \
		 << __FUNCTION__  << ") -> CHK FAILED: (" << #__VA_ARGS__ << ")" << "\n", exit(0);
#else
	#define dbg(...) 0
	#define chk(...) 0
#endif

const int MOD = 1e9 + 7; // 998244353;
const ld PI = acos((ld) -1);

typedef decay<decltype(MOD)>::type T;
struct mi {
    T val;
    explicit operator T() const { return val; }
    mi() { val = 0; }
    mi(const ll& v) {
        val = (-MOD <= v && v <= MOD) ? v : v % MOD;
        if (val < 0) val += MOD; }
    friend ostream& operator<<(ostream& os, const mi& a) { return os << a.val; }
    friend void pr(const mi& a) { pr(a.val); }
    friend void re(mi& a) { ll x; re(x); a = mi(x); }
    friend bool operator==(const mi& a, const mi& b) { return a.val == b.val; }
    friend bool operator!=(const mi& a, const mi& b) { return !(a == b); }
    friend bool operator<(const mi& a, const mi& b) { return a.val < b.val; }
    mi operator-() const { return mi(-val); }
    mi& operator+=(const mi& m) {
        if ((val += m.val) >= MOD) val -= MOD;
        return *this; }
    mi& operator-=(const mi& m) {
        if ((val -= m.val) < 0) val += MOD;
        return *this; }
    mi& operator*=(const mi& m) { val = (ll) val * m.val % MOD;
        return *this; }
    friend mi pow(mi a, ll p) {
        mi ans = 1; assert(p >= 0);
        for (; p; p /= 2, a *= a) if (p & 1) ans *= a;
        return ans; }
    friend mi inv(const mi& a) { assert(a != 0); return pow(a, MOD - 2); }
    mi& operator/=(const mi& m) { return (*this) *= inv(m); }
    friend mi operator+(mi a, const mi& b) { return a += b; }
    friend mi operator-(mi a, const mi& b) { return a -= b; }
    friend mi operator*(mi a, const mi& b) { return a *= b; }
    friend mi operator/(mi a, const mi& b) { return a /= b; }
};

typedef pair<mi,mi> pmi;
typedef vector<mi> vmi;
const int MAX = 12;
const int INF = 1e9;
ll num[MAX];
ll get(int x){
    if(x < MAX) return num[x];
    else return INF;
}
ll LCM(ll x, ll y){
    return x/__gcd(x, y) * y;
}
bool bad(ll x, ll y, ll targ){
    if(targ % (__gcd(x, y)) != 0) return true;
    return false;
}
int main(){
    num[0] = 0; num[1] = 9;
    f1r(i, 2, MAX) num[i] = num[i-1] * 10;
    setIO("");
    ll s; re(s);
    mi ans = 0;
    // case 1 fully contains nothing
    // only one number
    f1r(i, 1, s+1){
        if(s%i == 0 && s/i<get(i)){
            ans += (pow(mi(10), i-1)*9-s/i+1);
        }
    }
    // two numbers span
    f1r(i, 1, s){
        // i, i+1
        if(i+i+1>s) continue;
        // i would be doing this, but tle
        ll t = s-(i+i+1);
        ll m1 = get(i)-2, m2 = get(i+1)-2;
        ll c1 = -t, c2 = t;
        // min to make m1 positive
        c1 += (t+i)/(i+1)*(i+1);
        c2 -= (t+i)/(i+1)*i;
        if(c2 < 0) continue;
        if(m2 < c2){
            ll sub = (c2-m2+i-1)/i;
            c2 -= sub*i;
            c1 += sub*(i+1);
            if(c1 > m1) continue;
            if(c2 < 0) continue;
        }
        assert(0 <= c1 && c1 <= m1 && 0 <= c2 && c2 <= m2 && i*c1 + (i+1)*c2 == t);
        // c1 is currently as small as possible
        assert(c1 - (i+1) < 0 || c2 + i > m2);
        ll a1 = (m1-c1)/(i+1);
        ll a2 = c2/i;
        ans += (min(a1, a2)+1);
    }
    // has to contain something in between
    f1r(l, 1, 11){
        f1r(r, l, 11){
            ll tot = 0;
            f1r(j, l, r+1) tot += num[j]*j;
            if(tot > s) continue;
            // case 1, nothing on either side
            if(tot == s) ans += 1;
            // case 2, something on left
            if(l >= 2){
                ll u1 = l-1;
                ll need = s-tot-u1;
                ll m1 = get(l-1)-2;
                if(need >= 0 && need%u1 == 0 && need/u1 <= m1){
                    ans += 1;
                }
            }
            // case 3, something on right
            if(true){
                ll u2 = r+1;
                ll need = s-tot-u2;
                ll m2 = get(r+1)-2;
                if(need >= 0 && need%u2 == 0 && need/u2 <= m2){
                    ans += 1;
                }
            }
            // case 4 something on both sides
            if(l >= 2){
                ll u1 = l-1;
                ll u2 = r+1;
                ll m1 = get(l-1)-2;
                ll m2 = get(r+1)-2;
                ll need = s-tot-u1-u2;
                if(need < 0) continue;
                if(bad(u1, u2, need)) continue;
                ll c1 = 0;
                while((need-u1*c1)%u2 != 0){
                    c1++;
                }
                ll c2 = (need-u1*c1)/u2;
                if(c1 > m1) continue;
                if(c2 < 0) continue;
                ll d1 = LCM(u1, u2)/u1;
                ll d2 = LCM(u1, u2)/u2;
                if(c2 > m2){
                    ll sub = (c2-m2+d2-1)/d2;
                    c2 -= sub*d2;
                    c1 += sub*d1;
                    if(c1 > m1) continue;
                    if(c2 < 0) continue;
                }
                assert(0 <= c1 && c1 <= m1);
                assert(0 <= c2 && c2 <= m2);
                assert(u1*c1 + (u2)*c2 == need);
                assert(c1 - d1 < 0 || c2 + d2 > m2);
                ll a1 = (m1-c1)/d1;
                ll a2 = c2/d2;
                ans += (min(a1, a2)+1);
            }
        }
    }
    ps(ans);
}


Measured memory_bytes: 3664