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
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define mp make_pair
#define st first
#define nd second
#define pii pair<int, int>
#define vi vector<int>
#define pb push_back
#define _upgrade ios_base::sync_with_stdio(0), cout.setf(ios::fixed), cout.precision(10), cin.tie(0), cout.tie(0);
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define fwd(i, a, b) for (int i = (a); i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(c) (c).begin(), (c).end()
#define sz(X) (int)((X).size())
typedef long double ld;
typedef unsigned long long ull;
typedef long long ll;
#ifdef LOCAL
ostream &operator<<(ostream &out, string str) {
   for (char c : str)
      out << c;
   return out;
}
template <class L, class R> ostream &operator<<(ostream &out, pair<L, R> p) { return out << "(" << p.st << ", " << p.nd << ")"; }
template <class L, class R, class S> ostream &operator<<(ostream &out, tuple<L, R, S> p) {
   auto &[a, b, c] = p;
   return out << "(" << a << ", " << b << ", " << c << ")";
}
template <class T> auto operator<<(ostream &out, T a) -> decltype(a.begin(), out) {
   out << '{';
   for (auto it = a.begin(); it != a.end(); it = next(it))
      out << (it != a.begin() ? ", " : "") << *it;
   return out << '}';
}
void dump() { cerr << "\n"; }
template <class T, class... Ts> void dump(T a, Ts... x) {
   cerr << a << ", ";
   dump(x...);
}
#define debug(...) cerr << "[" #__VA_ARGS__ "]: ", dump(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define int long long

namespace BRUT {

#define md(a) (a) > mod ? (a)-mod : (a)

   const int MAXN = 1209;
   const int mod = 1e9 + 7;

   int dp[MAXN][MAXN];
   int nextL[MAXN], nextR[MAXN];

   void clear(int t) {
      rep(i, t + 2) rep(j, t + 2) dp[i][j] = 0;
      rep(i, t + 2) {
         nextL[i] = -1;
         nextR[i] = -1;
      }
   }

   int solve(string s) {
      clear(sz(s));
      for (int i = sz(s) - 1; i >= 0; i--) {
         nextL[i] = s[i] == 'L' ? i + 1 : nextL[i + 1];
         nextR[i] = s[i] == 'P' ? i + 1 : nextR[i + 1];
      }
      dp[0][0] = 1;
      rep(k, sz(s) + 1) {
         int zakres = min(k, sz(s) - k) + 2;
         if (nextR[k] != -1)
            rep(i, zakres) dp[nextR[k]][i] = md(dp[k][i + 1] + dp[nextR[k]][i]);
         if (nextL[k] != -1)
            rep(i, zakres) dp[nextL[k]][i + 1] = md(dp[k][i] + dp[nextL[k]][i + 1]);
      }
      int res = 0;
      fwd(k, 1, sz(s) + 1) res = md(res + dp[k][0]);
      return res % mod;
   }
} // namespace BRUT

int32_t main() {
   _upgrade;
   int n;
   cin >> n;
   vector<string> S(n);
   rep(i, n) cin >> S[i];
   rep(i, n) {
      debug(i);
      rep(j, n) { cout << BRUT::solve(S[i] + S[j]) << " \n"[j == n - 1]; }
   }
}