#include #include using namespace std; using mint = atcoder::static_modint<(int)1e9 + 7>; template class y_combinator { F f; public: y_combinator(F&& f) : f(std::forward(f)) {} template auto operator()(Args &&... args) const { return f(*this, std::forward(args)...); } }; using ll = long long; using ld = long double; template > using prique = std::priority_queue, U>; template T floor(T a, T b) { return a / b - (a % b && (a ^ b) < 0); } template T ceil(T a, T b) { return floor(a + b - 1, b); } template bool chmin(T& x, const T& y) { return (x > y ? x = y, true : false); } template bool chmax(T& x, const T& y) { return (x < y ? x = y, true : false); } #define overload4(a, b, c, d, e, ...) e #define rep1(a) for (long long _i = 0; _i < (a); _i++) #define rep2(i, a) for (long long i = 0; i < (a); i++) #define rep3(i, a, b) for (long long i = (a); i < (b); i++) #define rep4(i, a, b, c) for (long long i = (a); i < (b); i += (c)) #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define rrep(i, a, b, c) for (long long i = (a); i > (b); i += (c)) #define all(x) std::begin(x), std::end(x) #define rall(x) std::rbegin(x), std::rend(x) #define pb push_back mint f(ll x) { mint t = 1; ll y = x; while(x) { t *= x % 10; x /= 10; } //printf("x=%lld,t=%d\n", y, t.val()); return t; } void run_case() { string S; cin >> S; const int N = S.size(); mint ans = 0; for(int d = 1; d < N; d++) { ans += mint::raw(45).pow(d); } int ch = S.front() - '0'; const mint inv2 = mint::raw(2).inv(); ans += mint::raw(45).pow(N - 1) * (ch - 1) * ch * inv2; mint ml = ch; for(int i = 1; i < N; i++) { int ch = S[i] - '0'; mint s = mint::raw(45).pow(N - i - 1); ans += ml * s * inv2 * (ch - 1) * ch; ml *= ch; } ans += ml; cout << ans.val() << endl; return; mint na = 0; for(ll d = 1; d <= stoll(S); d++) { na += f(d); } cout << na.val() << endl; } int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr); std::fixed(std::cout).precision(16); int T = 1; //cin >> T; while(T--) run_case(); return 0; }