#include <bits/stdc++.h>
using namespace std;

#define int long long

#define rep(i,s,n) for(int i = s;i<n;i++)
#define repe(i,s,n) for(int i = s;i<=n;i++)
#define rrep(i,s,n) for(int i = (n)-1;i>=(s);i--)
#define all(v) (v).begin(),(v).end()
#define pb push_back
#define fi first
#define se second
#define chmin(a,b) a=min((a),(b))
#define chmax(a,b) a=max((a),(b))
typedef long long ll;
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
typedef pair<pint,int> P1;
typedef pair<int,pint> P2;
typedef pair<pint,pint> PP;
static const ll maxLL = (ll)1 << 62;
const ll MOD=1000000007;
const ll INF=1e18;

string s;
bool add=true;
int ans=0,tmp;

signed main() {
    std::cin >> s;
    rep(i,0,s.size()){
        if(s[i]=='+')add=true;
        else if(s[i]=='-')add=false;
        else if(s[i]=='('){
            if(s[i+2]=='+')tmp=(s[i+1]-'0')+(s[i+3]-'0');
            else tmp=(s[i+1]-'0')-(s[i+3]-'0');
            if(add)ans+=tmp;
            else ans-=tmp;
            i+=4;
        }
        else ans+=(s[i]-'0')*pow(-1,1+add);
    }
    cout<<ans<<endl;

    return 0;
}