output_description: Print the maximum possible sum of the scores of the pairs.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      RX_1 RY_1 RC_1
      RX_2 RY_2 RC_2
      \vdots
      RX_N RY_N RC_N
      BX_1 BY_1 BC_1
      BX_2 BY_2 BC_2
      \vdots
      BX_N BY_N BC_N
attempt: import sys
  
  read = sys.stdin.buffer.read
  readline = sys.stdin.buffer.readline
  readlines = sys.stdin.buffer.readlines
  
  import numpy as np
  
  N = int(readline())
  S = np.frombuffer(b"-" + readline().rstrip(), "S1")
  Q = int(readline())
  query = map(int, read().split())
  
  isD = S == b"D"
  isM = S == b"M"
  isC = S == b"C"
  
  cumD = isD.cumsum(dtype=np.int64)
  cumM = isM.cumsum(dtype=np.int64)
  
  
  def F(K):
      x = cumD.copy()
      x[K:] -= cumD[:-K]
      x *= isM
      x[K + 1 :] -= isD[1:-K] * (cumM[K:-1] - cumM[: -K - 1])
      return (x.cumsum() * isC).sum()
  
  
  print("\n".join(str(F(K)) for K in query))
  
problem_description: Statement
  
  Snuke is playing with red and blue balls, placing them on a two-dimensional
  plane.
  
  First, he performed N operations to place red balls. In the i-th of these
  operations, he placed RC_i red balls at coordinates (RX_i,RY_i). Then, he
  performed another N operations to place blue balls. In the i-th of these
  operations, he placed BC_i blue balls at coordinates (BX_i,BY_i). The total
  number of red balls placed and the total number of blue balls placed are
  equal, that is, \sum_{i=1}^{N} RC_i = \sum_{i=1}^{N} BC_i. Let this value be
  S.
  
  Snuke will now form S pairs of red and blue balls so that every ball belongs
  to exactly one pair. Let us define the _score_ of a pair of a red ball at
  coordinates (rx, ry) and a blue ball at coordinates (bx, by) as |rx-bx| + |ry-
  by|.
  
  Snuke wants to maximize the sum of the scores of the pairs. Help him by
  finding the maximum possible sum of the scores of the pairs.
samples: [{"input": "2\n    0 0 1\n    3 2 1\n    2 2 1\n    5 0 1", "output": "8\n    \n\nIf we pair the red ball at coordinates (0,0) and the blue ball at coordinates\n(2,2), the score of this pair is |0-2| + |0-2|=4. Then, if we pair the red\nball at coordinates (3,2) and the blue ball at coordinates (5,0), the score of\nthis pair is |3-5| + |2-0|=4. Making these two pairs results in the total\nscore of 8, which is the maximum result.\n\n* * *"}, {"input": "3\n    0 0 1\n    2 2 1\n    0 0 2\n    1 1 1\n    1 1 1\n    3 3 2", "output": "16\n    \n\nSnuke may have performed multiple operations at the same coordinates.\n\n* * *"}, {"input": "10\n    582463373 690528069 8\n    621230322 318051944 4\n    356524296 974059503 6\n    372751381 111542460 9\n    392867214 581476334 6\n    606955458 513028121 5\n    882201596 791660614 9\n    250465517 91918758 3\n    618624774 406956634 6\n    426294747 736401096 5\n    974896051 888765942 5\n    726682138 336960821 3\n    715144179 82444709 6\n    599055841 501257806 6\n    390484433 962747856 4\n    912334580 219343832 8\n    570458984 648862300 6\n    638017635 572157978 10\n    435958984 585073520 7\n    445612658 234265014 6", "output": "45152033546"}]