def inp() a=gets.chomp.split(" ").map(&:to_i)end 
def inpf() a=gets.chomp.split(" ").map(&:to_f)end
def inps() a=gets.chomp.split(" ")end  
def copy(a) Marshal.load(Marshal.dump(a)) end
def kaizyo(n)(n < 2)? 1 : (2..n).inject(:*) end
def scount(a,b) a.each{|n|b[n]+=1} end
def na(n,d=0) Array.new(n,d)end
def na2(n,m,d=0) Array.new(n){Array.new(m,d)}end
def na3(n,m,l,d=0) Array.new(n){Array.new(m){Array.new(l,d)}}end

s = inps[0]
n=[]
m=[]

if(s[0] == "-" or s[0] == "+")
  i=s[1,10].split("+")[0].split("-")[0].size
  n.push(s[0,i+1].to_i)
  s.slice!(0,i+1)
else
i=s.split("+")[0].split("-")[0].size
  n.push(s[0,i].to_i)
  s.slice!(0,i)
end
while(s.size > 0)
  m.push(s[0])
  s.slice!(0,1)
if(s[0] == "-" or s[0] == "+")
  i=s[1,10].split("+")[0].split("-")[0].size
  n.push(s[0,i+1].to_i)
  s.slice!(0,i+1)
else
i=s.split("+")[0].split("-")[0].size
  n.push(s[0,i].to_i)
  s.slice!(0,i)
end
end
sum=n[0]
n.delete_at(0)
m.size.times do |i|
  if(m[i]=="+")
    sum-=n[i]
  else
    sum+=n[i]
  end
end
p sum
=begin


=end