B'You are given an undirected graph consisting of n vertices and n edges, where n is divisible by 6 . Each edge has a weight, which is a positive (greater than zero) integer. The graph has the following structure: it is split into frac{n}{3} triples of vertices, the first triple consisting of vertices 1, 2, 3 , the second triple consisting of vertices 4, 5, 6 , and so on. Every pair of vertices from the same triple is connected by an edge. There are no edges between vertices from different triples. You have to paint the vertices of this graph into two colors, red and blue. Each vertex should have exactly one color, there should be exactly frac{n}{2} red vertices and frac{n}{2} blue vertices. The coloring is called valid if it meets these constraints. The weight of the coloring is the sum of weights of edges connecting two vertices with different colors. Let W be the maximum possible weight of a valid coloring. Calculate the number of valid colorings with weight W , and print it modulo 998244353 . The first line contains one integer n ( 6 <= n <= 3 cdot 10^5 , n is divisible by 6 ). The second line contains n integers w_1, w_2, ... , w_n ( 1 <= w_i <= 1000 ) -- the weights of the edges. Edge 1 connects vertices 1 and 2 , edge 2 connects vertices 1 and 3 , edge 3 connects vertices 2 and 3 , edge 4 connects vertices 4 and 5 , edge 5 connects vertices 4 and 6 , edge 6 connects vertices 5 and 6 , and so on. Print one integer -- the number of valid colorings with maximum possible weight, taken modulo 998244353 . The following picture describes the graph from the first example test. The maximum possible weight of a valid coloring of this graph is 31 . '...