1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
#include <bits/stdc++.h>
 
using namespace std;
 
#define endl '\n'
#define L long long
#define MP make_pair
#define REP(i, n) for(int i = 0; i < n; ++i)
#define REPR(i, n) for(int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define FORR(i, a, b) for(int i = b - 1; i >= a; --i)
#define EB emplace_back
#define ST first
#define ND second
#define S size
#define RS resize
 
template<class T> using P = pair<T, T>;
template<class T> using V = vector<T>;

int n;
L mod = 1e9 + 7;

L solve(string d) {
    int r = (int)d.size() + 1;
    V<V<L>> dp(r, V<L>(r));
    dp[0][0] = 1;
    FOR(i, 1, r) {
        REP(j, r) {
            int c = d[i] == 'P' ? 1 : -1;
            if (j + c < 0 || j + c >= r) {
                continue;
            }
            REPR(k, i) {
                dp[i][j] += dp[k][j + c];
                if (d[k] == d[i]) {
                    break;
                }
            }
            dp[i][j] %= mod;
        }
    }

    L res = 0;
    FOR(i, 1, r) {
        res += dp[i][0];
    }
    return res % mod;
}
 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
 
    cin >> n;
    V<string> d(n);
    REP(i, n) {
        cin >> d[i];
    }

    REP(i, n) {
        REP(j, n) {
            cout << solve("$" + d[i] + d[j]) << ' ';
        }
        cout << '\n';
    }
}

// g++ -std=c++17 -Wall -Wextra -Wshadow -Wconversion -D_GLIBCXX_DEBUG baj.cpp -o baj