#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define erep(i,a,b) for(int i=a;i<=(int)(b);++i)
#define per(i,a,b) for(int i=(b);i>(a);--i)
#define eper(i,a,b) for(int i=((int)(a));i>=b;--i)
#define pb push_back
#define mp make_pair
#define INF 1e18
#define MOD 1000000007
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a,int b){return a/gcd(a, b)*b;}

string s;
int i = 0;
ll solve();
ll sub() {
    if ('0' <= s[i] && s[i] <= '9') {
        ll val = s[i] - '0';
        i++;
        return val;
    }
    if (s[i] == '(') {
        i++;
        ll val = solve();
        i++;
        return val;
    }
}

ll solve() {
    ll clc = sub();
    while (true) {
        if (s[i] == '+') {
            i++;
            clc += sub();
        } else if (s[i] == '-') {
            i++;
            clc -= sub();
        } else 
            return clc;
    }
}

int main() {
 ios::sync_with_stdio ( false );
 cin.tie ( 0 );
    cin >> s;
    cout << solve() << endl;
    return 0;
}