mod=998244353
def cmb(n,r):
  if r<0 or r>n:
    return 0
  return ((g1[n]*g2[r]%mod)*g2[n-r])%mod

def perm(n,r):
  return g1[n]*g2[n-r]%mod
 
N=300000
g1=[1]*(N+3)
for i in range(2,N+3):
  g1[i]=g1[i-1]*i%mod
g2=[0]*len(g1)
g2[-1]=pow(g1[-1],mod-2,mod)
for i in range(N+1,-1,-1):
  g2[i]=g2[i+1]*(i+1)%mod
inv=[0]*(N+3)
for i in range(1,N+3):
  inv[i]=g2[i]*g1[i-1]%mod

N=5432
A=[[0]*(i+4) for i in range(N+1)]
A[2][1]=1
A[0][0]=1
for i in range(1,N-1):
  for j in range(i+1):
    A[i+2][j+1]=(A[i+1][j+1]*(j+1)+A[i+1][j]*(i+1-j)+A[i][j]*(i+1))%mod
ANS=0
N=int(input())
C=input().count('0')
for i in range(C+1):
  for j in range(N-C+1):
    a,b=N-i-j,C-i
    ANS=(ANS+((((cmb(C,i)*cmb(N-C,j)%mod)*perm(N,i)%mod)*perm(N-i,j)%mod)*A[a][b]%mod)*(g1[a-b]*g1[b]%mod))%mod
print(ANS)