#include<iostream>
#include<vector>
#include<algorithm>
#include<cctype>
#include<utility>
#include<string>
#include<cstring>
#include<cmath>
#include<numeric>
#include<queue>
#include<climits>
#include<cstdio>


#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
//#define INF ((LLONG_MAX) / (2))
using namespace std;
typedef pair<int, int> P;
typedef pair<llong, llong> LP;
typedef pair<int, P> PP;
typedef pair<llong, LP> LPP;
typedef long long int ll;
typedef pair<ll,int> LL_IP;
typedef pair<ll,ll> LL_LLP;
#define INF 1e9+7


int main(){

    string s;
    cin >> s;
    int a=0,b=0;
    bool pm = true;
    bool ari_pm;
    int i = 0;

    if(isdigit(s[0])){
        pm = true;
        //最初が数字ならこれは正の数
    }else{
        if(s[0] == '+'){
            pm = true;
            i++;
            //正の数
        }else{
            pm = false;
            i++;
            //負の数
        }
    }

    
    while(isdigit(s[i]) && i < s.length()){
        a = a*10 +  (int)(s[i]-'0');
        i++;
    }
    //この時点でs[i]は演算符号のところにいる
    //ここではじめの数字が求まる
    if(!pm){
        a = -a;
    }
    if(s[i] == '+'){
        ari_pm = false;
    }else{
        ari_pm = true;
    }
    i++;

    //cout << s[i] << endl;
    if(isdigit(s[i])){
        pm = true;
        //最初が数字ならこれは正の数
    }else{
        if(s[i] == '+'){
            pm = true;
            i++;
            //正の数
        }else{
            pm = false;
            i++;
            //負の数
        }
    }
    
    while(isdigit(s[i]) && i < s.length()){
        b = b*10 + (int)(s[i]-'0');
        i++;
    }
    if(!pm){
        b = -b;
    }



    int ans;
    if(ari_pm){
        ans = a+b;
    }else{
        ans = a-b;
    }
    //cout << a << " " << b << endl;
    cout << ans << endl;


    return 0;
}