output_description: Print the number, modulo 998244353, of ways to paint each of the integers red,
  green or blue so that the condition is satisfied.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      a_1
      :
      a_N
attempt: N = int(input())
  a = [int(input()) for _ in range(N)]
  s = sum(a)
  m = (s + 1) // 2
  
  c1 = [0] * (m + 1)
  c1[m] = 1
  for i in range(N):
      d = a[i]
      for j in range(m - d + 1):
          c1[j] = (2 * c1[j] + c1[j + d]) % 998244353
      for j in range(m - d + 1, m + 1):
          c1[j] = (2 * c1[j] + c1[m]) % 998244353
  
  ans1 = c1[0]
  
  if s % 2:
      c1[0] = 0
  else:
      for j in range(m):
          c1[j] = 0
      c1[m] = 1
      for i in range(N):
          d = a[i]
          for j in range(m - d + 1):
              c1[j] = (c1[j] + c1[j + d]) % 998244353
          for j in range(m - d + 1, m + 1):
              c1[j] = c1[j]
  
  ans = (3**N % 998244353 - 3 * ans1 + 3 * c1[0]) % 998244353
  print(ans)
  
problem_description: Statement
  
  You are given N integers. The i-th integer is a_i. Find the number, modulo
  998244353, of ways to paint each of the integers red, green or blue so that
  the following condition is satisfied:
  
    * Let R, G and B be the sums of the integers painted red, green and blue, respectively. There exists a triangle with positive area whose sides have lengths R, G and B.
samples: [{"input": "4\n    1\n    1\n    1\n    2", "output": "18\n    \n\nWe can only paint the integers so that the lengths of the sides of the\ntriangle will be 1, 2 and 2, and there are 18 such ways.\n\n* * *"}, {"input": "6\n    1\n    3\n    2\n    3\n    5\n    2", "output": "150\n    \n\n* * *"}, {"input": "20\n    3\n    1\n    4\n    1\n    5\n    9\n    2\n    6\n    5\n    3\n    5\n    8\n    9\n    7\n    9\n    3\n    2\n    3\n    8\n    4", "output": "563038556"}]