#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i = (a); i < (b); ++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n) - 1; (i) >= 0; --i)
#define SZ(n) (int)(n).size()
#define ALL(n) (n).begin(), (n).end()
#define MOD LL(1e9 + 7)
#define INF 1000000
using namespace std;
typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PI;

int main() {
	string s;
	cin >> s;
	int i = 0;
	while (1) {
		if (s[i + 1] == '+' || s[i + 1] == '-') {
			s.insert(i + 1, "A");
			s.insert(i + 3, "A");
			break;
		}
		i++;
	}
	int p1 = s.find("A", 0);
	int p2 = s.find("A", p1 + 1);
	int x = stoi(s.substr(0, p1));
	int y = stoi(s.substr(p2 + 1, s.size() - p2 - 1));
	char op = s[p1 + 1];
	if (op == '-')
		cout << x + y << endl;
	else
		cout << x - y << endl;
	return 0;
}