B"Given an integer sequence a_1, a_2, ... , a_n of length n , your task is to compute the number, modulo 998244353 , of ways to partition it into several non-empty continuous subsequences such that the sums of elements in the subsequences form a balanced sequence. A sequence s_1, s_2, ... , s_k of length k is said to be balanced, if s_{i} = s_{k-i+1} for every 1 <= q i <= q k . For example, [1, 2, 3, 2, 1] and [1,3,3,1] are balanced, but [1,5,15] is not. Formally, every partition can be described by a sequence of indexes i_1, i_2, ... , i_k of length k with 1 = i_1 < i_2 < ... < i_k <= q n such that Let s_1, s_2, ... , s_k denote the sums of elements in the subsequences with respect to the partition i_1, i_2, ... , i_k . Formally, for every 1 <= q j <= q k , s_j = sum_{i=i_{j}}^{i_{j+1}-1} a_i = a_{i_j} + a_{i_j+1} + ... + a_{i_{j+1}-1}. For example, the partition [1 ,| ,2,3 ,| ,4,5,6] of sequence [1,2,3,4,5,6] is described by the sequence [1,2,4] of indexes, and the sums of elements in the subsequences with respect to the partition is [1,5,15] . Two partitions i_1, i_2, ... , i_k and i'_1, i'_2, ... , i'_{k'} (described by sequences of indexes) are considered to be different, if at least one of the following holds. Each test contains multiple test cases. The first line contains an integer t ( 1 <= q t <= q 10^5 ) -- the number of test cases. The following lines contain the description of each test case. The first line of each test case contains an integer n ( 1 <= q n <= q 10^5 ), indicating the length of the sequence a . The second line of each test case contains n integers a_1, a_2, ... , a_n ( 0 <= q a_i <= q 10^9 ), indicating the elements of the sequence a . It is guaranteed that the sum of n over all test cases does not exceed 10^5 . For eac"...