#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <iostream>
#include <queue>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;


int main(){
  string str;
  cin >> str;

  int af = 1;
  int an = 0;
  int flg = 0;
  int bf = 1;
  int bn = 0;
  int i=0;
  if(str[0] == '+'){
    i++;
  }
  else if(str[0] == '-'){
    af = -1;
    i++;
  }
  while('0'<=str[i] && str[i]<='9'){
    an = an*10 + (str[i]-'0');
    i++;
  }

  if(str[i] == '+' && str[i+1] == '+'){
    i+=2;
    flg = 1;
    bf = 1;
  }
  else if(str[i] == '+' && str[i+1] == '-'){
    i+=2;
    flg = 1;
    bf = -1;
  }
  else if(str[i] == '-' && str[i+1] == '+'){
    i+=2;
    flg = -1;
    bf = 1;
  }
  else if(str[i] == '-' && str[i+1] == '-'){
    i+=2;
    flg = -1;
    bf = -1;
  }
  else if(str[i] == '+'){
    i++;
    flg = 1;
    bf = 1;
  }
  else if(str[i] == '-'){
    i++;
    flg = -1;
    bf = 1;
  }
  while(i<str.length()){
    bn = bn*10 + (str[i]-'0');
    i++;
  }

  if(flg == 1){
    cout << af*an - bf*bn << endl;
  }else{
    cout << af*an + bf*bn << endl;
  }
  
  return 0;
}