#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define ull unsigned long long
#define nl '\n'
#define sz(x) (ll)(x.size())
#define all(x) x.begin(),x.end()
#define rall(s)  s.rbegin(), s.rend()
#define getline(s) getline(cin>>ws,s)
#define ceill(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
#define pi  3.141592653589793
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define multi_ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>


void Fast_IO(){
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
// freopen("filename.in", "r", stdin);
// freopen("filename.txt", "w", stdout);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}

int dx[] = { 2, 1, -1, -2, -2, -1, 1, 2 };
int dy[] = { 1, 2, 2, 1, -1, -2, -2, -1 };

ll n;
vector<vector<char>>grid;
vector<vector<ll>>dp;

bool valid(ll i, ll j){
    return i < n and j<n and grid[i][j] != '*';
}

const ll mod = 1e9+7;

ll rec(ll i, ll j){
    if(!valid(i,j)) return 0;
    if(i == n-1 and j == n-1) return 1;
    if(dp[i][j] != -1) return dp[i][j];
    ll ans = 0;
    ans = (ans + rec(i+1,j))%mod;
    ans = (ans + rec(i,j+1))%mod;
    return dp[i][j] = ans%mod;
}




void solve(){
  cin>>n;
  grid.assign(n,vector<char>(n));
    dp.assign(n+3,vector<ll>(n+3,-1));
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            cin>>grid[i][j];
        }
    }

    cout<<rec(0,0)<<nl;





}

int main(){
    Fast_IO();
int t =1;
//cin>>t;
while(t--){
solve();
}
return 0;
}