#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 998244353;
int n;
bool good(int x, int y){
	return x>=1 && x<=n && y>=1 && y<=n;
}
bool bad = false;
int solve(vector<vector<char>>arr){
	vector<vector<bool>>vis(n+1,vector<bool>(n+1));
	vector<vector<int>>dp(n+1,vector<int>(n+1));
	for(int i = 1; i<=n; i++){
		for(int j = 1; j<=n; j++){
			if(arr[i][j]=='#'){
				dp[i][j] = 1;
			}
			dp[i][j]|=dp[i][j-1];
			if(arr[i][j]=='.'){
				dp[i][j] = 0;
			}
		}
	}
	for(int i = 1; i<=n; i++){
		int cur = 0;
		for(int j = n; j>=1; j--){
			if(arr[i][j]=='#'){
				cur = 1;
			}
			if(arr[i][j] == '?' && cur && dp[i][j]){
				bad = true;
			}
			if(arr[i][j] == '.'){
				cur = 0;
			}
		}
	}
	queue<pair<int,int>>q;
	for(int i = 1; i<=n; i++){
		for(int j = 1; j<=n; j++){
			if(arr[i][j] == '#'){
				vis[i][j] = true;
				q.push({i,j});
			}
		}
	}
	vector<int>dx = {0,0};
	vector<int>dy = {-1,1};
	while(q.size()){
		auto cur = q.front(); q.pop();
		int i = cur.first;
		int j = cur.second;
		for(int d = 0; d<2; d++){
			int x = i+dx[d];
			int y = j+dy[d];
			if(good(x,y) && !vis[x][y] && arr[x][y]=='?'){
				vis[x][y] = true;
				q.push({x,y});
			}
		}
	}
	int ans = 1;
	for(int i = 1; i<=n; i++){
		int cur = 0;
		for(int j = 1; j<=n; j++){
			if(vis[i][j])continue;
			if(arr[i][j] == '.' && cur){
				ans*=(cur+1);
				cur = 0;
				ans%=mod;
			}
			if(arr[i][j]=='?'){
				cur++;
			}
		}
		//cout << cur << '\n';
		if(cur){
			ans*=cur+1;
			ans%=mod;
		}
	}
	return ans;
}

signed main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	cin >> n;
	vector<vector<char>>arr(n+1,vector<char>(n+1));
	for(int i = 1; i<=n; i++){
		string s;
		cin >> s;
		for(int j = 1; j<=n; j++){
			arr[i][j] = s[j-1];
		}
	}
	int a = solve(arr);
	for(int i = 1; i<=n; i++){
		for(int j = i; j<=n; j++){
			swap(arr[i][j],arr[j][i]);
		}
	}
	int b = solve(arr);
	if(bad){
		cout << "0\n";
		return 0;
	}
	cout << (a*b)%mod << '\n';
	return 0;
}