#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)

const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;

const ll MOD = 998244353;

vector<ll> fac;
void c_fac(ll x=pow(10,7)+10) { fac.resize(x); rep(i,x) fac[i] = i ? fac[i-1]*i%MOD : 1; }

vector<vector<ll>> nck;
void c_nck(ll N) {
  nck.resize(N+1, vector<ll>(N+1));
  nck[0][0] = 1;
  rep(i,N+1) rep(j,N+1) {
    if (i) nck[i][j] = (nck[i][j] + nck[i-1][j]) % MOD;
    if (i&&j) nck[i][j] = (nck[i][j] + nck[i-1][j-1]) % MOD;
  }
}

int main() {
  ll N; cin >> N;
  string S; cin >> S;
  ll c0 = 0, c1 = 0; rep(i,N) { if (S[i]=='0') c0++; else c1++; }
  c_fac(N+1);
  c_nck(N);

  assert(1<=N && N<=5000);
  rep(i,N) assert(S[i]=='0'||S[i]=='1');

  // dp[N][M]: 長さ N の撹乱順列 A について、i < A_i を満たす i が M 個である場合の数
  vector<vector<ll>> dp(N+1, vector<ll>(N+1)); dp[0][0] = 1;
  rep(i,N) rep(j,N+1) {
    if (i+2<=N&&j+1<=N) dp[i+2][j+1] = (dp[i+2][j+1] + dp[i][j]*(i+1)) % MOD;
    if (j+1<=N) dp[i+1][j+1] = (dp[i+1][j+1] + dp[i][j]*(i-j)) % MOD;
    dp[i+1][j] = (dp[i+1][j] + dp[i][j]*j) % MOD;
  }
  // rep(i,N+1) debug(all(dp[i]));


  ll result = 0;
  // eq0: S[i] = '0' かつ A[i] = B[i] を満たす i の個数
  // eq1: S[i] = '1' かつ A[i] = B[i] を満たす i の個数
  rep(eq0,c0+1) rep(eq1,c1+1) {
    // pos_eq: A[i] = B[i] を満たす位置
    // num_eq: A[i] = B[i] を満たす数
    // pos_neq_1: A = (1, 2, ..., N) で固定した時の B の場合の数
    // pos_neq_2: A の並べかえ方

    ll pos_eq = (nck[c0][eq0]*fac[eq0]%MOD) * (nck[c1][eq1]*fac[eq1]%MOD) % MOD;
    ll num_eq = nck[c0+c1][eq0] * nck[c0+c1-eq0][eq1] % MOD;
    ll pos_neq_1 = dp[(c0-eq0)+(c1-eq1)][c0-eq0];
    ll pos_neq_2 = fac[c0-eq0] * fac[c1-eq1] % MOD;
    ll num = pos_eq * num_eq % MOD * pos_neq_1 % MOD * pos_neq_2 % MOD;

    result = (result + num) % MOD;
    // cout << eq0 << "," << eq1 << " -> " << num << endl;
  }

  cout << result << endl;
  return 0;
}