output_description: Print the maximum possible value of X-Y.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      V_1 V_2 ... V_N
      C_1 C_2 ... C_N
attempt: n = int(input())
  v = list(map(int,input().split()))
  c = list(map(int,input().split()))
  ans = 0
  for i in range(n):
    if v[i] > c[i]:
      ans + = (v[i]-c[i])
    else:
      continue
  print(ans)
problem_description: Statement
  
  There are N gems. The value of the i-th gem is V_i.
  
  You will choose some of these gems, possibly all or none, and get them.
  
  However, you need to pay a cost of C_i to get the i-th gem.
  
  Let X be the sum of the values of the gems obtained, and Y be the sum of the
  costs paid.
  
  Find the maximum possible value of X-Y.
samples: [{"input": "3\n    10 2 5\n    6 3 4", "output": "5\n    \n\nIf we choose the first and third gems, X = 10 + 5 = 15 and Y = 6 + 4 = 10. We\nhave X-Y = 5 here, which is the maximum possible value.\n\n* * *"}, {"input": "4\n    13 21 6 19\n    11 30 6 15", "output": "6\n    \n\n* * *"}, {"input": "1\n    1\n    50", "output": "0"}]