#include <cmath>
#include <iostream>
#include <vector>

#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;

using u128 = __uint128_t;
const int MOD = 1e9+7;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n; cin >> n;
    string s; cin >> s;

    u128 ans = 0;

    const int jumps = sqrt(2*n)+1;
    vector dp(n, vector<u128>(jumps, 0));
    dp[0][0] = 1;
    rep(i, n) {
        if (s[i] == '#') continue;
        rep(j, jumps)
            if (i+1 < n) dp[i+1][j] += dp[i][j];
            else ans += dp[i][j];
        rep(j, jumps-1)
            if (i+j+2 < n) dp[i+j+2][j+1] += dp[i][j];
            else ans += dp[i][j];
    }
    cout << static_cast<int>(ans % MOD) << '\n';
}