output_description: Print the answer.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      D_1 D_2 ... D_N
attempt: N = int(input())
  D = [int(x) for x in input().split()]
  print(0)
  
problem_description: Statement
  
  Given is an integer sequence D_1,...,D_N of N elements. Find the number,
  modulo 998244353, of trees with N vertices numbered 1 to N that satisfy the
  following condition:
  
    * For every integer i from 1 to N, the distance between Vertex 1 and Vertex i is D_i.
samples: [{"input": "4\n    0 1 1 2", "output": "2\n    \n\nFor example, a tree with edges (1,2), (1,3), and (2,4) satisfies the\ncondition.\n\n* * *"}, {"input": "4\n    1 1 1 1", "output": "0\n    \n\n* * *"}, {"input": "7\n    0 3 2 1 2 2 1", "output": "24"}]