#include "bits/stdc++.h"
#include "atcoder/all"
using namespace std;
using namespace atcoder;
using mint = modint1000000007;
const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
mint dp[100005][2];
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	string N;
	cin >> N;
	mint ans = 0;
	mint anssub = 1;
	rep(i, N.size() - 1) {
		anssub *= 45;
		ans += anssub;
	}
	dp[0][0] = 1;
	dp[0][1] = 0;
	rep(i, N.size()) {
		int num = N[i] - '0';
		dp[i + 1][0] += dp[i][0] * num;
		rep(j, num) {
			dp[i + 1][1] += dp[i][0] * j;
		}
		dp[i + 1][1] += dp[i][1] * 45;
	}
	ans += dp[N.size()][0] + dp[N.size()][1];
	cout << ans.val() << endl;
	return 0;
}