#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <bitset>
using namespace std;
typedef long long ll;

int main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	string s,t; cin >> s >> t;
	s+="+";
	s=s+t;
	ll ans=0;
	ll num=0;
	int sign=1;
	s="+"+s;
	int n=s.size();
	for(int i=0;i<s.size();i++){
		sign=1;
		if(s[i]=='+'||s[i]=='-'){
			while(i<n&&(s[i]=='+'||s[i]=='-')){
				if(s[i]=='-')sign^=1;
				i++;
			}
			num=0;
			while(i<n&&'0'<=s[i]&&s[i]<='9'){
				num*=10;
				num+=(s[i]-'0');
				i++;
			}
			i--;
			if(sign==0)sign=-1;
			ans+=num*sign;
		}
	}
	cout << ans << endl;
}