#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
 
using namespace std;
 
#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(int i=(a);i<(b);++i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
 
#define MOD 1000000007

long long ston(string s){
  long long n;
  sscanf(s.c_str(), "%lld", &n);
  return n;
}

int main(){
  string s;
  cin>>s;
  int flag;
  int index;
  rep(i,1,s.sz){
    if(s[i]=='+'){
      flag = 0;
      index = i;
      break;
    }
    if(s[i]=='-'){
      flag = 1;
      index = i;
      break;
    }    
  }
  int ans;
  if(s[0]=='-'&&s[index+1]=='-'){
    string s1,s2;
    rep(i,1,index){
      s1+=s[i];
    }
    rep(i,index+2,s.sz){
      s2+=s[i];
    }
    if(flag == 0)ans=-ston(s1)+ston(s2);
    if(flag == 1)ans=-ston(s1)-ston(s2);
  }
  if(s[0]=='-'&&s[index+1]!='-'){
    string s1,s2;
    rep(i,1,index){
      s1+=s[i];
    }
    rep(i,index+1,s.sz){
      s2+=s[i];
    }
    if(flag == 0)ans=-ston(s1)-ston(s2);
    if(flag == 1)ans=-ston(s1)+ston(s2);
  }
  if(s[0]!='-'&&s[index+1]=='-'){
    string s1,s2;
    rep(i,0,index){
      s1+=s[i];
    }
    rep(i,index+2,s.sz){
      s2+=s[i];
    }
    if(flag == 0)ans=ston(s1)+ston(s2);
    if(flag == 1)ans=ston(s1)-ston(s2);
  }
  if(s[0]!='-'&&s[index+1]!='-'){
    string s1,s2;
    rep(i,0,index){
      s1+=s[i];
    }
    rep(i,index+1,s.sz){
      s2+=s[i];
    }
    if(flag == 0)ans=ston(s1)-ston(s2);
    if(flag == 1)ans=ston(s1)+ston(s2);
  }
  cout << ans <<endl;
  return 0;
}