#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define ios ios_base::sync_with_stdio(0) ; cin.tie(0) ; cout.tie(0)
#define so sizeof
#define pb push_back
#define cl clear() ;
#define vl vector<ll>
#define sz size()
#define len length()
#define el endl;cout.flush()
#define be begin()
#define fi first
#define se second
#define br break
#define en end()
#define ro return 0
#define br break
#define eb emplace_back
#define con continue
#define ms(x) memset(x , 0, so x)
#define all(x) (x).be , (x).en
#define acc(x) accumulate((x).be , (x).en , 0ll)
#define forn(i,a,b) for(ll i=a;i<=b;++i)
#define rng_58 mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define vll vector<pair<ll,ll> >
#define pll pair<ll,ll>
#define plll pair<ll,pair<ll,ll>>
#define plvl pair<pair<ll,ll> ,ll>
#define mp make_pair
#define trace3(a,b,c) cerr <<"a is " << a << " b is " << b << " c is " << c << el;
#define trace4(a,b,c,d) cerr <<"a is " << a << " b is " << b << " c is " << c <<" d is " << d << el ;
#define trace5(a,b,c,d,e) cerr <<"a is " << a << " b is " << b << " c is " << c <<" d is " << d << " e is " << e << el;
#define trace6(a,b,c,d,e,f) cerr <<"a is " << a << " b is " << b << " c is " << c <<" d is " << d << " e is " << e << " f is " << f << el ;

int main()
{
    ios;
    string s ;
    cin >> s ;
    ll n = s.len ;
    ll m = n-1 ;
    vector<string > ans ;
    forn(i , 0 , (1<<m) -1 ){
       char arr[m] ;
       for(ll j = 0 ; j <= m-1; ++j){
          if(i & (1 << j)){
            arr[j] = '+';
          }
          else {
            arr[j] = '.' ;
          }
       }
       string res = "" ;
       ll p1 = 0 , p2 = 0 ;
       ll cnt = 0 ;
       while(1) {
          if(cnt & 1){
             res = res + arr[p2];
             ++p2 ;
             ++cnt ;
          }
          else{
            res = res + s[p1] ;
            ++p1 ;
            ++cnt ;
          }
          if(p1 == n) br ;
       }
       string news = "" ;
       forn(i , 0 , res.len - 1 ){
          if(res[i] == '.') con ;
          else {
            news = news + res[i] ;
          }
       }
       ans.pb(news) ;
    }
    ll ziz = 0 ;
    for(auto &x : ans){
       /// cout << " x  is " <<x << el ;
        string res = "";
        forn(i , 0 , x.len - 1) {
            if(x[i] != '+') res = res + x[i] ;
            else if(x[i] == '+'){
                ///cout << "here res is " << res << el;
                stringstream geek(res);
                ll xx = 0 ;
                geek >> xx ;
                ziz = ziz + xx;
                res = "" ;
            }
        }
        if(res.sz != 0 ) {
            stringstream geek(res);
            ll xx = 0 ;
            geek>> xx;
            ziz = ziz +xx ;
           /// cout << "here xx is " << xx << el ;
        }
    }
    cout << ziz << el ;
}































Measured memory_bytes: 256