#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 4000001;
const double eps = 1E-18;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long 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 {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= 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 {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

mint pw(mint a, ll b) {
	if (b == 0) { return 1; }
	mint ret = pw(a, b>>1);
	ret *= ret;
	if (b & 1) { ret *= a; }
	return ret;
}

typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;

typedef vector<mint> vmint;
typedef vector<vector<mint>> vvmint;
typedef vector<vector<vector<mint>>> vvvmint;


//////////////////////////
mint cmod(ll n) {
	return pw(10, n - 1) * 9;
}

int main() {
	ll S;
	cin >> S;
	mint ans = 0;

	vector<ll> c(10, 9);
	for (ll i = 2; i <= 9; i++) { c[i] = c[i - 1] * 10; }


	for(ll d=1; d*d<=S; d++) {
		if (S % d == 0) {
			ll x = S / d;
			if (d>=10||c[d] >= x) { ans += cmod(d) - x + 1; }

			if (d != x) {
				if (x >= 10 || c[x] >= d) { ans += cmod(x) - d + 1; }
			}
		}
	}

	//cout << ans << endl;

	
	repn(d, (S+1)/2) {
		ll mn = (S + 1 + d) / (d + 1);
		if (d <= 8) { mn = max(mn, (S - c[d + 1] + d - 1) / d); }

		ll mx = (S - 1) / d;
		if (d <= 9) { mx = min(mx, (S + c[d]) / (d + 1)); }

		if (mx >= mn) { ans += (mx - mn + 1); }

		//cout << d << " " << mn << " " << mx << endl;
	}

	//cout << ans << endl;

	repn(d, 8) {
		for (ll e = d + 2; e <= 8; e++) {
			ll T = S;

			for (ll i = d + 1; i < e; i++) {
				T -= i * c[i];
			}

			//cout << d << " " << e << " " << T << endl;

			if (T < 0) { continue; }

			for (ll x = 1; x <= c[d]; x++) {
				if (x * d >= T) { break; }

				if ((T - x * d) % e != 0) { continue; }

				ll y = (T - x * d) / e;

				if (y >= 1 && y <= c[e]) { ans += 1; }
			}
		}
	}

	cout << ans << endl;


}


Measured memory_bytes: 384