// 基本テンプレート
 
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
using namespace std;
 
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define int long long int
 
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
 
typedef pair<int, int> pii;
typedef long long ll;
 
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const ll INF = 1001001001001001LL;
const ll MOD = 1000000007LL;

int parse(string s, int l, int r) {
    int cur = l, ret = 0, op = 1;
    while(cur < r) {
        if(isdigit(s[cur])) ret += op * (s[cur] - '0');
        else if(s[cur] == '(') {
            int nl = cur, nr = cur;
            while(s[nr] != ')') nr++;
            ret += op * parse(s, nl+1, nr);
            cur = nr;
        }
        else {
            if(s[cur] == '+') op = 1;
            else if(s[cur] == '-') op = -1;
            else assert(false);
        }
        cur++;
    }
    return ret;
}
 
signed main() {
    string s; cin >> s;

    int len = s.length();
    cout << parse(s, 0, len) << endl;
    return 0;
}