#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define RT return
#define vv(a,b,c,d) vector<vector<a> >(b,vector<a>(c,d))
#define vvv(a,b,c,d,e) vector<vector<vector<a> > >(b,vv(a,c,d,e))
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;

template<int MOD>
class ModInt {
public:
    ModInt() :value(0) {}
    ModInt(long long val) :value((int)(val<0 ? MOD + val%MOD : val%MOD)) { }

    ModInt& operator+=(ModInt that) {
        value = value + that.value;
        if (value >= MOD)value -= MOD;
        return *this;
    }
    ModInt& operator-=(ModInt that) {
        value -= that.value;
        if (value<0)value += MOD;
        return *this;
    }
    ModInt& operator*=(ModInt that) {
        value = (int)((long long)value * that.value % MOD);
        return *this;
    }
    ModInt &operator/=(ModInt that) {
        return *this *= that.inverse();
    }
    ModInt operator+(ModInt that) const {
        return ModInt(*this) += that;
    }
    ModInt operator-(ModInt that) const {
        return ModInt(*this) -= that;
    }
    ModInt operator*(ModInt that) const {
        return ModInt(*this) *= that;
    }
    ModInt operator/(ModInt that) const {
        return ModInt(*this) /= that;
    }
    ModInt pow(long long k) const {
        if (value == 0)return 0;
        ModInt n = *this, res = 1;
        while (k) {
            if (k & 1)res *= n;
            n *= n;
            k >>= 1;
        }
        return res;
    }
    ModInt inverse() const {
        long long a = value, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b;
            swap(a, b);
            u -= t * v;
            swap(u, v);
        }
        return ModInt(u);
    }
    int toi() const { return value; }

private:
    int value;
};
typedef ModInt<1000000007> mint;
ostream& operator<<(ostream& os, const mint& x) {
    os << x.toi();
    return os;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(20);

    const int MA = 100000000;
    int S;
    cin >> S;

    mint ans;
    {
        ll sm = 0;
        int r = 1;
        ll rNext = 10;
        ll rDigits = 1;
        ll lNext = 10;
        ll lDigits = 1;
        for (int l = 1; l < MA; ++l) {
            while (sm < S) {
                sm += rDigits;
                if (++r == rNext) {
                    rNext *= 10;
                    rDigits++;
                }
            }
            if (sm == S) ans += 1;
            if (l == lNext) {
                lNext *= 10;
                lDigits++;
            }
            sm -= lDigits;
        }
    }

    for (int len = 1; len <= S; ++len) {
        ll lDigits = S / len;
        if (lDigits <= 8)continue;
        if (S%len == 0) {
            // len桁の数はnum個
            mint num = mint(10).pow(lDigits - 1) * 9;
            // num個のうちlen個使う
            // num >= len
            ans += num - len + 1;
        } else {
            // lDigits桁の数をx個、残りはrDigits=lDigits+1桁の数を使う
            // lDigits * x + (lDigits+1)*(len-x) = S
            // lDigits>=9で9桁の数は10^8*9個あり不足することはない
            // 1<=x
            // lDigits, len, Sは定数なのでxは一意
            ans += 1;
        }
    }

    cout << ans << endl;
}

Measured memory_bytes: 384