#include<cstdio>
#include<cstring>
#include<algorithm>

#define fi first
#define se second
#define mkp std::make_pair
using ll=long long;
using llu=unsigned long long;
using std::max;
using std::min;
template<class T> void cmax(T&a,T b){a=max(a,b);}
template<class T> void cmin(T&a,T b){a=min(a,b);}

const ll mod=998244353;
const int NV=3e3;

namespace xm{
    int f[NV+5][NV+5],C[NV+5];
    bool cf[NV+5];
    char sz[NV+5][NV+5];
    void _(){
        int N;

        scanf("%d",&N);
        for(int i=1;i<=N;++i){
            scanf("%s",sz[i]+1);
            sz[i][0]='1';
        }
        f[0][0]=1;
        for(int i=0;i<=N;++i) C[i]=1;
        for(int i=1;i<=N;++i){
            int c,s=0;
            bool rf=0;
            for(int j=0;j<=N;++j){
                if(sz[i][j]=='0') rf=1;
                if(sz[i][j]=='1'){
                    if(rf) c=0;
                    else c=1;
                }
                if(sz[i][j]=='?'&&!rf) ++c;
                f[i][j]=(ll)f[i-1][j]*c%mod;
                if(!rf){
                    if(cf[j]) f[i][j]=(f[i][j]+(ll)C[j]*s)%mod;
                    else f[i][j]=(f[i][j]+(ll)(C[j]-1)*s)%mod;
                }
                s=((ll)s*C[j]+f[i-1][j])%mod;
                if(sz[i][j]=='0') cf[j]=1;
                if(sz[i][j]=='1'){
                    if(cf[j]) C[j]=0;
                    else C[j]=1;
                }
                if(sz[i][j]=='?'&&!cf[j]) ++C[j];
            }
        }
        ll ans=0;
        for(int j=0;j<=N;++j)
            ans=((ll)ans*C[j]+f[N][j])%mod;
        printf("%lld\n",ans);
    }
}

int main(){
    xm::_();
    return 0;
}