#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define CK(N, A, B) (A <= N && N < B)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define RREP(i, a, b) for (int i = (b - 1); a <= i; i--)
#define F first
#define S second
#define ll long long

const int INF = 1e9;
const long long LLINF = 1e18;

using namespace std;

int dy[] = {0,1,0,-1};
int dx[] = {1,0,-1,0};
int dy8[] = {0,1,1,1,0,-1,-1,-1};
int dx8[] = {1,1,0,-1,-1,-1,0,1};

/*==================================================*/
/*variable*/
string s;

/*==================================================*/
/*function*/
ll parse(int p, ll ret){

    if(p == s.size()){
        return ret;
    }

    if(s[p] == '('){
        ret = parse(p+1, ret);
    }else if(s[p] == ')'){
        return parse(p+1, ret);
    }else if(s[p] == '+') {
        ret += parse(p+1, ret);
    }else if(s[p] == '-'){
        ret -= parse(p+1, ret);
    }else{
        return parse(p+1, (s[p] - '0'));
    }

    return ret;
}
/*==================================================*/

int main() {
    cin>>s;

    cout<<parse(0, 0)<<endl;

    return 0;
}