#include typedef long long ll; const int INF = 1e9,MOD = 1e9+7,ohara = 1e6; const ll LINF = 1e18; using namespace std; #define rep(i,n) for(ll (i)=0;(i)<(int)(n);(i)++) #define rrep(i,a,b) for(ll i=(a);i<(b);i++) #define rrrep(i,a,b) for(ll i=(a);i>=(b);i--) #define all(v) (v).begin(), (v).end() #define pb(q) push_back(q) #define Size(n) (n).size() #define Cout(x) cout<<(x)<>s; cnt=0; if(s[0]=='+')cnt=1,b=1; else if(s[0]=='-')cnt=1,b=-1; rrep(i,cnt,Size(s)){ if(s[i]=='+'){ cnt=i+1; a=-1; break; } else if(s[i]=='-'){ cnt=i+1; a=1; break; } x+=s[i]; } if(s[cnt]=='+')cnt++,c=1; else if(s[cnt]=='-')cnt++,c=-1; rrep(i,cnt,Size(s)){ y+=s[i]; } xx=atoi(x.c_str()); yy=atoi(y.c_str()); xx*=b; yy*=c; if(a==-1){ Cout(xx-yy); } else Cout(xx+yy); return 0; }