int r = a%m;

if(r<0)r+=m;

return r;

fastio;

int n;

cin>>n;

memset(dp,0,sizeof(dp));

dp[0][0]=1;

for(int i=0;i<n;i++){

cin>>s[i];

}

if(s[0][0]=='*'){

cout<<0<<endl;

return 0;

}

for(int i=0;i<n;i++){

for(int j=0;j<n;j++){

if(i==0 && j==0)continue;

if(s[i][j]=='*')dp[i][j]=-inf;

else{

dp[i][j]=0;

if(i-1>=0)dp[i][j]=mod(max(dp[i-1][j],0LL),MOD);

if(j-1>=0)dp[i][j]=mod(dp[i][j]+max(dp[i][j-1],0LL),MOD);

}

}

}

if(s[n-1][n-1]=='*')cout<<0<<endl;

else cout<<dp[n-1][n-1]<<endl;

}