import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, core.bitop;

enum inf = 1<<30;
enum full = (1<<26) - 1;

void main() {
    string s;
    scan(s);

    int n = s.length.to!int;

    long ans;

    void dfs(int i, long val, long d) {
        if (i == n) {
            debug {
                writeln(val + d);
            }
            ans += val + d;
            return;
        }
        dfs(i + 1, val, d*10 + s[i] - '0');
        dfs(i + 1, val + d, s[i] - '0');
    }

    dfs(1, 0, s[0] - '0');

    writeln(ans);
}










































void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}



void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}
