#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define fr(i, a, b) for (int i = (a); i < (b); i++)
#define all(c) (c).begin(), (c).end()
using namespace std;
typedef long long ll;
const ll inf = 1e9;
const ll mod = 1e9 + 7;

int main() {
    string s;
    cin >> s;

    int p = 0;
    int Lsgn = 1;
    int Rsgn = 1;

    if (s[p] == '+') {
        Lsgn = 1;
        p++;
    } else if (s[p] == '-') {
        Lsgn = -1;
        p++;
    }

    int start = p;
    while (s[p] != '+' && s[p] != '-') p++;
    int end = p;

    int ope;
    
    if (s[p] == '+') {
        ope = 0;
    } else {
        ope = 1;
    }
    p++;

    if (s[p] == '+') {
        Rsgn = 1;
        p++;
    } else if (s[p] == '-') {
        Rsgn = -1;
        p++;
    }

    string left = s.substr(start, end - start);
    string right = s.substr(p);

    int lv = atoi(left.c_str());
    int rv = atoi(right.c_str());

    lv *= Lsgn;
    rv *= Rsgn;

    int ans = lv;

    if (ope == 0) {
        ans -= rv;
    } else {
        ans += rv;
    }

    cout << ans << endl;
}