#include <iostream>

using namespace std;
using ll = long long;
const int MX = 400010;
ll f[MX],inv[MX],fi[MX];
constexpr ll mod = 998244353;
void solve(){
    inv[1] = 1;
    for(int i=2;i<MX;i++){
        inv[i] = mod - (mod/i)*inv[mod%i]%mod;
    }
    f[0] = fi[0] = 1;
    for(int i=1;i<MX;i++){
        f[i] = f[i-1]*i%mod;
        fi[i] = fi[i-1]*inv[i]%mod;
    }
}

ll nck(ll n, ll k){
    if(n<0 || k<0 || n<k) return 0;
    return f[n]*fi[k]%mod*fi[n-k]%mod;
}

ll dp[5010][5010] = {};
int main(){
    int i,j,n; cin >> n;
    string s; cin >> s;
    solve();
    int z = 0;
    for(i=0;i<n;i++){
        if(s[i]=='0') z++;
    }
    dp[0][0] = 1;
    for(i=0;i<=n;i++){
        for(j=0;j<=i;j++){
            if(i>=2 && j) dp[i][j] += dp[i - 2][j - 1]*(i - 1)%mod;
            if(i) dp[i][j] += dp[i - 1][j]*j%mod;
            if(i && j) dp[i][j] += dp[i - 1][j - 1]*(i - j)%mod;
            dp[i][j] %= mod;
        }
    }
    ll ans = 0;
    for(i=0;i<=n;i++){
        for(j=0;j<=i;j++){
            int a = j,b = i - j,c = n - i;
            (ans += dp[i][j]*nck(n,i)%mod*nck(z,a)%mod*f[a]%mod*nck(n - z,b)%mod*f[b]%mod*f[c]%mod) %= mod;
        }
        //cout << i << " " << ans << endl;
    }
    cout << ans << "\n";
}