#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>

#define REP(i,n) for(long (i)=0;(i)<(n);(i)++)
#define FOR(i,a,b) for(long (i)=(a);(i)<(b);(i)++)
#define RREP(i,a) for(long (i)=(a)-1;(i)>=0;(i)--)
#define FORR(i,a,b) for(long (i)=(a)-1;(i)>=(b);(i)--)
#define MOD 1000000007
#define PI acos(-1.0)
#define DEBUG(C) cout<<C<<endl;
#define PII pair<int,int>
#define PLL pair<long,long>
#define ALL(a) (a).begin(),(a).end()
#define SORT(a) sort((a).begin(),(a).end())
#define RSORT(a) sort((a).begin(),(a).end(),greater<int>())

typedef long long LL;
typedef unsigned long long ULL;

using namespace std;

class myclass{
public:
    void func(){}
};

int main(void){
	string s; cin>>s;
	int a=0,b=0;
	int e=0;
	bool pf=true;
	bool ff;
	REP(i,s.size()){
		if(i==0&&(s[i]=='-'||s[i]=='+')){
			if(s[i]=='-')pf=false;
		}else if(i!=0&&(s[i]=='+'||s[i]=='-')){
			if(!pf) a*=(-1);
			e=i; break;
		}else{
			a*=10;
			a+=(int)(s[i]-'0');
		}
	}
	if(s[e]=='-') ff=true;
	else if(s[e]=='+')ff=false;
	pf=true;
	FOR(i,e+1,s.size()){
		if(i==e+1&&(s[i]=='-'||s[i]=='+')){
			if(s[i]=='-') pf=false;
		}else{
			b*=10;
			b+=(int)(s[i]-'0');
		}
	}
	if(!pf) b*=-1;
	//DEBUG(a)DEBUG(b)
	if(ff) cout<<a+b<<endl;
	else cout<<a-b<<endl;
}