write a go solution for D. Even Stringtime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputYou would like to construct a string s, consisting of lowercase Latin letters, such that the following condition holds:  For every pair of indices i and j such that s_i=s_j, the difference of these indices is even, that is, |i-j|bmod2=0. Constructing any string is too easy, so you will be given an array c of 26 numbers — the required number of occurrences of each individual letter in the string s. So, for every iin[1,26], the i-th letter of the Latin alphabet should occur exactly c_i times.Your task is to count the number of distinct strings s that satisfy all these conditions. Since the answer can be huge, output it modulo 998,244,353.InputEach test consists of several test cases. The first line contains a single integer t (1<=t<=10^4)— the number of test cases. The description of test cases follows.Each test case contains 26 integers c_i (0<=c_i<=5*10^5)— the elements of the array c.Additional constraints on the input data:  The sum of c_i for every test case is positive;  The sum of c_i over all test cases does not exceed 5*10^5. OutputFor each test case, print one integer — the number of suitable strings s, taken modulo 998,244,353.ExampleInput52 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 03 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 1 00 0 0 0 0 0 0 0 0 0 0 0 1 0 3 0 0 0 0 0 0 0 0 0 0 01 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 01 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 233527 233827Output4
960
0
1
789493841
NoteIn the first test case, there are 4 suitable strings: "abak", "akab", "baka" and "kaba".. Output only the code with no comments, explanation, or additional text.