#include <iostream>
#include <algorithm>
#include <functional>
#include <string>
#include <climits>
#include <vector>
#include <numeric>
#include <complex>
using namespace std;

#define long __int64
//#define __int64 long long
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
const int Vecy[4] = {0,-1,0,1};
const int Vecx[4] = {1,0,-1,0};

int func(int start, int end, string a){
	int result = 0;
	for(int i=start; i<end; i++){
		result *= 10;
		result += a[i] - '0';
	}
	
	return result;
}

void ans(int a, char op, int b){
	if(op == '+'){
		cout << a - b << endl;
	}else{
		cout << a + b << endl;
	}
}

int change(char op, int a){
	if(op == '+'){
		return a;
	}else{
		return -a;
	}
}

int main(){
	string in;
	int a,b;
	int cnt = 0;
	int hugou[3] = {0};
	cin >> in;
	
	//符号位置検索
	for(int i=0; i<in.length(); i++){
		if(in[i] == '+' || in[i] == '-'){
			hugou[cnt] = i;
			cnt++;
		}
	}
	
	if(cnt == 1){
		a = func(0, hugou[0], in);
		b = func(hugou[0] + 1, in.length(), in);
		ans(a, in[hugou[0]], b);
	}else if(cnt == 3){
		a = change(in[hugou[0]], func(1, hugou[1], in));
		b = change(in[hugou[2]], func(hugou[2] + 1, in.length(), in));
		ans(a, in[hugou[1]], b);
	}else{
		if(hugou[0] == 0){		//前者に符号
			a = change(in[hugou[0]], func(1, hugou[1], in));
			b = func(hugou[1] + 1, in.length(), in);
			ans(a, in[hugou[1]], b);
		}else{					//後者に符号
			a = func(0, hugou[0], in);
			b = change(in[hugou[1]], func(hugou[1] + 1, in.length(), in));
			ans(a, in[hugou[0]], b);
		}
	}
    
    return 0;
}