#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=1e3+5,M=N*4,K=600+5,mod=998244353,Mod=mod-1;const db eps=1e-6;const ll INF=1e15+7;mt19937 rnd(263082);
int n,m;char s[N][N];ll ans;
void Do(){
	int i,j,h;for(i=1;i<=n;i++) {
		for(j=1;j<=n;j++){
			if(s[i][j]^'?') continue;
			for(h=j+1;h<=n;h++) if(s[i][h]^'?') break;
			h--;
			int w=(s[i][j-1]=='#')+(s[i][h+1]=='#');
			// cerr<<i<<' '<<j<<' '<<h<<'\n';
			if(w==2) ans=0;
			else if(!w) ans=ans*(h-j+2)%mod;
			j=h;
		}
	}
}
void Solve(){
	int i,j,h;scanf("%d",&n);
	for(i=1;i<=n;i++) scanf("%s",s[i]+1);
	ans=1;
	Do();
	for(i=1;i<=n;i++) for(j=1;j<i;j++) swap(s[i][j],s[j][i]);
	Do();
	printf("%lld\n",ans);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}