AquaMoon and Chess
Cirno gave AquaMoon a chessboard of size $$$1 \times n$$$. Its cells are numbered with integers from $$$1$$$ to $$$n$$$ from left to right. In the beginning, some of the cells are occupied with at most one pawn, and other cells are unoccupied.In each operation, AquaMoon can choose a cell $$$i$$$ with a pawn, and do either of the following (if possible):   Move pawn from it to the $$$(i+2)$$$-th cell, if $$$i+2 \leq n$$$ and the $$$(i+1)$$$-th cell is occupied and the $$$(i+2)$$$-th cell is unoccupied.  Move pawn from it to the $$$(i-2)$$$-th cell, if $$$i-2 \geq 1$$$ and the $$$(i-1)$$$-th cell is occupied and the $$$(i-2)$$$-th cell is unoccupied. You are given an initial state of the chessboard. AquaMoon wants to count the number of states reachable from the initial state with some sequence of operations. But she is not good at programming. Can you help her? As the answer can be large find it modulo $$$998\,244\,353$$$.
In the first test case the strings "1100", "0110" and "0011" are reachable from the initial state with some sequence of operations.
The input consists of multiple test cases. The first line contains a single integer $$$t$$$ ($$$1 \leq t \leq 10\,000$$$) — the number of test cases.The first line contains a single integer $$$n$$$ ($$$1 \leq n \leq 10^5$$$) — the size of the chessboard.The second line contains a string of $$$n$$$ characters, consists of characters "0" and "1". If the $$$i$$$-th character is "1", the $$$i$$$-th cell is initially occupied; otherwise, the $$$i$$$-th cell is initially unoccupied.It is guaranteed that the sum of $$$n$$$ over all test cases does not exceed $$$10^5$$$.
For each test case, print the number of states that reachable from the initial state with some sequence of operations modulo $$$998\,244\,353$$$.
import sys
p2D = lambda x: print(*x, sep='\n')

def II():
    return int(sys.stdin.buffer.readline())

def MI():
    return map(int, sys.stdin.buffer.readline().split())

def LI():
    return list(map(int, sys.stdin.buffer.readline().split()))

def LLI(rows_number):
    return [LI() for _ in range(rows_number)]

def BI():
    return sys.stdin.buffer.readline().rstrip()

def SI():
    return sys.stdin.buffer.readline().rstrip().decode()

def li():
    return [int(i) for i in input().split()]

def lli(rows):
    return [li() for _ in range(rows)]

def si():
    return input()

def ii():
    return int(input())

def ins():
    return input().split()
fval = [1]
mod = 998244353

def fact(n):
    for i in range(1, n):
        fval.append(fval[-1] * i % mod)

def solve():
    n = II()
    s = SI()
    z = 0
    o = 0
    i = 0
    while i < n:
        t = 0
        if s[i] == '0':
            z += 1
            i += 1
        while i < n and s[i] == '1':
            t += 1
            i += 1
        o += t // 2
    return fval[o + z] * pow(fval[o], -1, mod) * pow(fval[z], -1, mod) % mod

def main():
    fact(100010)
    for _ in range(II()):
        sys.stdout.write(str(solve()) + '\n')
if __name__ == '__main__':
    main()
num_inp = lambda : int(input())
arr_inp = lambda : list(map(int, input().split()))
sp_inp = lambda : map(int, input().split())
str_inp = lambda : input()
MOD = 998244353
f = [1, 1]

def factorial(x):
    l = len(f)
    while l <= x:
        f.append(f[l - 1] * l % MOD)
        l += 1
    return f[x]
T = int(input())
k = [1]
for i in range(T):
    n = int(input())
    arr = input()
    h = dict()
    p = [0]
    r = 0
    s = 0
    r = arr.count('11')
    s = arr.count('0')
    k = [1]
    (pf, zf) = (factorial(r), factorial(s))
    print(factorial(r + s) * pow(pf, -1, MOD) % MOD * pow(zf, -1, MOD) % MOD)
MOD = 998244353
f = [1, 1]

def factorial(x):
    l = len(f)
    while l <= x:
        f.append(f[l - 1] * l % MOD)
        l += 1
    return f[x]
t = int(input())
for __ in range(t):
    n = int(input())
    s = input()
    p = sum((len(block) // 2 for block in s.split('0')))
    z = s.count('0')
    print(factorial(p + z) * pow(factorial(p), -1, MOD) % MOD * pow(factorial(z), -1, MOD) % MOD)