#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>

#define pb push_back
#define puts(x) cout << #x << " : " << x << endl;
#pragma GCC diagnostic ignored "-Wconversion"

#define REP(i,n) for (int i=0;i<(n);i++)
#define REPE(i,n) for (int i=0;i<=(n);i++)

#define init(a,b) memset((a), (b), (sizeof(a)));

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

#if 0
#include <iostream>
#include <fstream>
ifstream fin("/tmp/input.txt");
#define cin fin
#endif

int main() {
    string s;
    cin >> s;
    string x="", y="";
    int i = 0;
    if (s[i] == '-'){
        x+='-';
        i++;
    }
    if (s[i] == '+'){
        i++;
    }
    while (s[i] != '-' && s[i] != '+'){
        x += s[i];
        i++;
    }
    char op = s[i];
    i++;
    if (s[i] == '-'){
        y+='-';
        i++;
    }
    if (s[i] == '+') {
        i++;
    }
    while (i < s.size()) {
        y += s[i];
        i++;
    }
    stringstream ss(x);
    int xi; ss >> xi;
    stringstream ss2(y);
    int yi; ss2 >> yi;
    if (op == '-') cout << xi + yi << endl;
    else  if (op == '+') cout << xi - yi << endl;
    return 0;
}