#include <bits/stdc++.h>
#include <atcoder/all>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define rep2(i, m, n) for(ll i = m; i <= n; i++)
#define rrep(i, m, n) for(ll i = m; i >= n; i--)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define MAX(x) *max_element(all(x))
#define MIN(x) *min_element(all(x))
#define SZ(a) ((ll)(a).size())
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
const int inf = 1e9 + 1;
const ll INF = 1e18 + 1;


using Graph = vector<vector<int>>;
Graph G;
//typedef atcoder::modint998244353 mint;
typedef atcoder::modint1000000007 mint;

mint dp[100010][2];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    string s; cin >> s;
    int n = s.size();

    dp[0][0] = 1;
    rep(i, n) {
        ll x = s[i] - '0';
        dp[i + 1][1] = dp[i][1] * 45 + dp[i][0] * x * (x - 1) / 2;
        dp[i + 1][0] = dp[i][0] * x;
    }
    mint res = 0;
    mint mul = 1;
    rep(i, n - 1) {
        mul *= 45;
        res += mul;
    }
    res += (dp[n][0] + dp[n][1]);
    cout << res.val() << endl;


}