#include<cassert>
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
using namespace std;

typedef long long LL;
typedef vector<int> VI;

#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(),i##_end=(c).end();i!=i##_end;++i)
#define eprintf(...) fprintf(stderr, __VA_ARGS__)

template<class T> inline void amin(T &x, const T &y) { if (y<x) x=y; }
template<class T> inline void amax(T &x, const T &y) { if (x<y) x=y; }
template<class Iter> void rprintf(const char *fmt, Iter begin, Iter end) {
    for (bool sp=0; begin!=end; ++begin) { if (sp) putchar(' '); else sp = true; printf(fmt, *begin); }
    putchar('\n');
}
template<unsigned MOD> struct ModInt {
    static const unsigned static_MOD = MOD;
    unsigned x;
    void undef() { x = (unsigned)-1; }
    bool isnan() const { return x == (unsigned)-1; }
    inline int geti() const { return (int)x; }
    ModInt() { x = 0; }
    ModInt(const ModInt &y) { x = y.x; }
    ModInt(int y) { if (y<0 || (int)MOD<=y) y %= (int)MOD; if (y<0) y += MOD; x=y; }
    ModInt(unsigned y) { if (MOD<=y) x = y % MOD; else x = y; }
    ModInt(long long y) { if (y<0 || MOD<=y) y %= MOD; if (y<0) y += MOD; x=y; }
    ModInt(unsigned long long y) { if (MOD<=y) x = y % MOD; else x = y; }
    ModInt &operator+=(const ModInt y) { if ((x += y.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(const ModInt y) { if ((x -= y.x) & (1u<<31)) x += MOD; return *this; }
    ModInt &operator*=(const ModInt y) { x = (unsigned long long)x * y.x % MOD; return *this; }
    ModInt &operator/=(const ModInt y) { x = (unsigned long long)x * y.inv().x % MOD; return *this; }
    ModInt operator-() const { return (x ? MOD-x: 0); }

    ModInt inv() const {
	unsigned a = MOD, b = x; int u = 0, v = 1;
	while (b) {
	    int t = a / b;
	    a -= t * b; swap(a, b);
	    u -= t * v; swap(u, v);
	}
	if (u < 0) u += MOD;
	return ModInt(u);
    }
    ModInt pow(long long y) const {
	ModInt b = *this, r = 1;
	if (y < 0) { b = b.inv(); y = -y; }
	for (; y; y>>=1) {
	    if (y&1) r *= b;
	    b *= b;
	}
	return r;
    }
    friend ModInt operator+(ModInt x, const ModInt y) { return x += y; }
    friend ModInt operator-(ModInt x, const ModInt y) { return x -= y; }
    friend ModInt operator*(ModInt x, const ModInt y) { return x *= y; }
    friend ModInt operator/(ModInt x, const ModInt y) { return x *= y.inv(); }
    friend bool operator<(const ModInt x, const ModInt y) { return x.x < y.x; }
    friend bool operator==(const ModInt x, const ModInt y) { return x.x == y.x; }
    friend bool operator!=(const ModInt x, const ModInt y) { return x.x != y.x; }
};

const LL MOD = 1000000007;
typedef ModInt<MOD> Mint;

LL TEN[21];

int R;
LL R_pos;
// 1*9 + 2*90 + 3*900 + ...;
LL calc(int b, int len, LL geta=0) {
    R = b;
    LL ret = 0;

    while (len) {
	LL sz;
	if (b >= 15) sz = 1LL<<40;
	else sz = 9 * TEN[b-1];
	LL g = min(sz, geta);
	sz -= g;
	geta -= g;

	g = min((LL)len, sz);

	ret += b * g;
	R = b;
	R_pos = g;
	len -= g;
	b++;
    }
    return ret;
}

LL S;

void MAIN() {
    TEN[0] = 1;
    REP (i, 20) TEN[i+1] = TEN[i] * 10;

    scanf("%lld", &S);

    Mint ans = 0;
    Mint ten = 1; // 10^(b-1);
    int b = 1;

    int len = 1;
    while (calc(1, len+1) <= S) len++;
    eprintf("%d\n", len);

    for (; len>=1; len--) {
	while (calc(b+1, len) <= S) {
	    b++;
	    ten *= 10;
	}

	LL small = calc(b, len);
	if (b == R && small == S) {
	    ans += 9 * ten - len + 1;
	} else {
	    LL rest = S - small;
	    if (b == R) {
		LL diff = 1;
		LL limit = len;
		if (rest % diff == 0 && rest / diff <= limit) {
		    ans+=1;
		}
	    } else {
		LL b_len = (b<=15? 9*TEN[b-1]: 1LL<<60);
		LL r_len = (R<=15? 9*TEN[R-1]: 1LL<<60);
		LL diff = R - b;
		LL limit = min(b_len, r_len - R_pos);
		if (rest % diff == 0 && rest / diff <= limit) {
		    ans+=1;
		} else if (b_len > r_len - R_pos && rest % diff == 0 && rest / diff > limit) {
		    LL z = calc(b, len, limit);
		    diff++;
		    if (S >= z && (S-z) % diff == 0 && (S-z) / diff <= (b_len - limit)) {
			ans += 1;
		    }
		}
	    }
	}
    }


    printf("%d\n", ans.geti());
}

int main() {
    int TC = 1;
//    scanf("%d", &TC);
    REP (tc, TC) MAIN();
    return 0;
}



Measured memory_bytes: 256