#include "bits/stdc++.h"

#define int long long
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = (1LL << 61);
ll mod = 1000000007;
struct mint {
	ll x; // typedef long long ll;
	mint(ll 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;
	}
};
istream& operator>>(istream& is, mint& a) { return is >> a.x; }
ostream& operator<<(ostream& os, const mint& a) { return os << a.x; }
// dp[決めた桁数][未満フラグ][mod100の値][確実に0を含まないか]
mint dp[10010][2][101][2];
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	string S; cin >> S;
	dp[0][0][1][0] = 1;
	int N = S.size();
	for (int i = 0; i < N; i++) {
		int D = S[i] - '0';
		for (int j = 0; j < 2; j++) {
			for (int k = 0; k < 100; k++) {
				for (int l = 0; l < 2; l++) {
					for (int d = 0; d <= (j ? 9 : D); d++) {
						if (l == 1 && d == 0)continue;
						dp[i + 1][j || (d < D)][(d ? (k * d) % 100 : k)][l || d] += dp[i][j][k][l];

					}
				}
			}
		}
	}
	cout << (dp[N][0][0][1].x + dp[N][1][0][1].x)%mod << endl;
	return 0;
}