output_description: Print the integer in Takahashi's mind after he eats all the symbols.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      S
attempt: import math
  import queue
  import bisect
  import heapq
  import time
  import itertools
  
  mod = int(1e9 + 7)
  
  
  def swap(a, b):
      return (b, a)
  
  
  def my_round(a, dig=0):
      p = 10**dig
      return (a * p * 2 + 1) // 2 / p
  
  
  def gcd(a, b):  # 最大公約数
      if a < b:
          a, b = swap(a, b)
      if b == 0:
          return a
      else:
          return gcd(b, a % b)
  
  
  def lcm(a, b):  # 最小公倍数
      return a / gcd(a, b) * b
  
  
  def divisors(a):  # 約数列挙
      divisors = []
      for i in range(1, int(a**0.5) + 1):
          if a % i == 0:
              divisors.append(i)
              if i != a // i:
                  divisors.append(a // i)
      return divisors
  
  
  def is_prime(a):  # 素数判定
      if a < 2:
          return False
      elif a == 2:
          return True
      elif a % 2 == 0:
          return False
      sqrt_num = int(a**0.5)
      for i in range(3, sqrt_num + 1, 2):
          if a % i == 0:
              return False
      return True
  
  
  def prime_num(a):  # 素数列挙
      pn = [2]
      for i in range(3, int(a**0.5), 2):
          prime = True
          for j in pn:
              if i % j == 0:
                  prime = False
                  break
          if prime:
              pn.append(i)
      return pn
  
  
  def prime_fact(a):  # 素因数分解
      sqrt = math.sqrt(a)
      res = []
      i = 2
      if is_prime(a):
          res.append(a)
      else:
          while a != 1:
              while a % i == 0:
                  res.append(i)
                  a //= i
              i += 1
      return res
  
  
  def main():
      s = input()
      ans = 0
      for i in range(4):
          if s[i] == "+":
              ans += 1
          else:
              ans -= 1
      print(ans)
      return
  
  
  if __name__ == "__main__":
      main()
  
problem_description: Statement
  
  There is always an integer in Takahashi's mind.
  
  Initially, the integer in Takahashi's mind is 0. Takahashi is now going to eat
  four symbols, each of which is `+` or `-`. When he eats `+`, the integer in
  his mind increases by 1; when he eats `-`, the integer in his mind decreases
  by 1.
  
  The symbols Takahashi is going to eat are given to you as a string S. The i-th
  character in S is the i-th symbol for him to eat.
  
  Find the integer in Takahashi's mind after he eats all the symbols.
samples: [{"input": "+-++", "output": "2\n    \n\n  * Initially, the integer in Takahashi's mind is 0.\n  * The first integer for him to eat is `+`. After eating it, the integer in his mind becomes 1.\n  * The second integer to eat is `-`. After eating it, the integer in his mind becomes 0.\n  * The third integer to eat is `+`. After eating it, the integer in his mind becomes 1.\n  * The fourth integer to eat is `+`. After eating it, the integer in his mind becomes 2.\n\nThus, the integer in Takahashi's mind after he eats all the symbols is 2.\n\n* * *"}, {"input": "-+--", "output": "-2\n    \n\n* * *"}, {"input": "----", "output": "-4"}]