#include <bits/stdc++.h>

using namespace std;

#define endl "\n"

// -----------------------------------------------------------------------------

constexpr int MOD = 1e9 + 7;

int qpow(int a, int b, int p) {
	int r = 1;
	for (; b; b >>= 1) {
		if (b & 1)
			r = 1ll * r * a % p;
		a = 1ll * a * a % p;
	}
	return r;
}

const int inv = qpow(2, MOD - 2, MOD);

#define add(x, y) ((x) = ((x) + (y)) % MOD)

constexpr int N = 2010;

int n, A[N][N];

int F[N][N][2];

void Main() {
	cin >> n;
	int cnt = 0;
	for (int i = 1; i <= n; ++i) {
		string str;
		cin >> str;
		for (int j = 1; j <= n; ++j) {
			int c = str[j - 1] == '.';
			cnt += (A[i][j] = c);
		}
	}
	F[0][0][0] = F[0][0][1] = qpow(2, cnt, MOD);
	for (int i = 0; i <= n; ++i)
		for (int j = 0; j <= n; ++j) {
			if (i) {
				add(F[i][j][1], F[i - 1][j][1]);
				if (A[i][j])
					add(F[i][j][1], 1ll * F[i - 1][j][0] * inv % MOD);
			}
			if (j) {
				add(F[i][j][0], F[i][j - 1][0]);
				if (A[i][j])
					add(F[i][j][0], 1ll * F[i][j - 1][1] * inv % MOD);
			}
		}
	cout << (F[n][n][0] + F[n][n][1]) % MOD << endl;
}

// -----------------------------------------------------------------------------

signed main() {
//	freopen("rural.in", "r", stdin);
//	freopen("rural.out", "w", stdout);
	ios::sync_with_stdio(false);
	cin.tie(nullptr), cout.tie(nullptr);
	Main();
	return 0;
}