//想定解
#include <iostream>
#include <string>
#include <vector>

using namespace std;

const long long mod = 1000000007;

int main(){
    string s;
    cin >> s;
    int n = s.size();
    vector<long long> exp2(n + 1, 0), exp11(n + 1, 0);
    exp2[0] = exp11[0] = 1;
    for (int i = 0; i < n; i++){
        exp2[i + 1] = exp2[i] * 2;
        exp2[i + 1] %= mod;
        exp11[i + 1] = exp11[i] * 11;
        exp11[i + 1] %= mod;
    }
    long long ans = 0;
    for (int i = 0; i < n; i++){
        long long tmp = s[i] - '0';
        tmp *= exp2[i];
        tmp %= mod;
        tmp *= exp11[n - 1 - i];
        tmp %= mod;
        ans += tmp;
        ans %= mod;
    }
    cout << ans << endl;
    return 0;
}