#include <bits/stdc++.h>
#define int long long // 仅在需要大整数时使用，memset 数组为 0x3f 时去掉
#define INF 0x3f3f3f3f
#define PII pair<int, int>
#define ULL unsigned long long
#define PIII tuple<int, int, int>
#define all(v) v.begin(), v.end()
#define debug(a) cout << #a << " = " << a << endl;
using namespace std;
constexpr int N = 1 * 1e6 + 10, M = 5 * 1e3 + 10;

string str;
int len, ans;
void dfs(int u,int sum) {
    if (u >= len) {
        ans += sum;
        return;
    }
    for (int i = u; i < len;  i++) {
        string num = str.substr(u, i - u + 1);
        dfs(i + 1, sum + stoll(num));
    }
}
void solve() {
    cin >> str;
    len = str.size();
    dfs(0, 0);
    cout << ans;
}

signed main() {
    ios::sync_with_stdio(0); cin.tie(nullptr), cout.tie(nullptr);
    int _ = 1;
    // cin >> _;
    while (_--) {
        solve();
    }
    return 0;
}

/**
 *    author: Nijika_jia
 *    description: C++17 Algorithm Template for Competitive Programming
 */