#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("Yes");}else{puts("No");} #define MAX_N 200005 int main() { string s; cin >> s; int n = s.size(); int x = 0; int y = 0; int flag[3] = {}; int mode = 0; rep(i,n){ if(mode == 0){ if(s[i] == '+'){ ; }else if(s[i] == '-'){ flag[0] = 1; }else{ x += s[i] - '0'; } mode = 1; }else if(mode == 1){ if(s[i] == '+'){ mode = 2; }else if(s[i] == '-'){ flag[1] = 1; mode = 2; }else{ x *= 10; x += s[i] - '0'; } }else{ if(s[i] == '+'){ ; }else if(s[i] == '-'){ flag[2] = 1; }else{ y *= 10; y += s[i] - '0'; } } } if(flag[0] == 1)x *= -1; if(flag[2] == 1)y *= -1; int ans = x - y; if(flag[1] == 1)ans = x + y; cout << ans << endl; return 0; }