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
#include <bits/stdc++.h>


using namespace std;

using ll = long long;

ll mod = 1e9+7;


ll query(string& s1, string& s2){
	vector<vector<ll>> dp(601, vector<ll>(2));
	dp[0][0] = 1ll;
	for (auto u: s1){
		if (u == 'L'){
			for (int i = 600; i > 0; i--){
				dp[i][0] = (dp[i-1][1]+dp[i-1][0])%mod;
			}
		}
		else{
			for (int i = 0; i < 600; i++) dp[i][1] = (dp[i+1][1] + dp[i+1][0])%mod;
		}
	}
	for (auto u: s2){
		if (u == 'L'){
			for (int i = 600; i > 0; i--){
				dp[i][0] = (dp[i-1][1]+dp[i-1][0])%mod;
			}
		}
		else{
			for (int i = 0; i < 600; i++) dp[i][1] = (dp[i+1][1] + dp[i+1][0])%mod;
		}
	}
	return dp[0][1]%mod;
}



int main(){
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int n;
	cin >> n;
	vector<string> s;
	string x;
	for (int i = 0; i < n; i++){
		cin >> x;
		s.push_back(x);
	}
	for (int i = 0; i < n; i++){
		for (int j = 0; j < n; j++) cout << query(s[i], s[j]) << ' ';
		cout << "\n";
	}
	return 0;
}