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
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<unordered_set>
#include<unordered_map>

using namespace std;

typedef vector<int> VI;
typedef long long LL;

#define FOR(x, b, e) for(int x=b; x<=(e); ++x)
#define FORD(x, b, e) for(int x=b; x>=(e); --x)
#define REP(x, n) for(int x=0; x<(n); ++x)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB push_back
#define ST first
#define ND second

int countForString(string &a) {
  int size = 2;
  unordered_set<string> res;
  
  while (size <= a.size()) {
    VI ids(a.size());
    FOR(i, a.size() - size, a.size() - 1) ids[i] = 1;
    do {
        int count = 0;
        string tmp;
        REP(i, a.size()) if (ids[i] > 0) {
            if (a[i] == 'L') count++;
            else count--;
            if (count < 0) break;
            tmp.PB(a[i]);
        }
        if (tmp.size() == size && count == 0) res.insert(tmp);
    } while (next_permutation(ids.begin(), ids.end()));
    size += 2;
  }

  int ans = res.size();
  res.clear();
  return ans;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(NULL); cout.tie(NULL);
    int n;
    cin >> n;
    vector<string> d(n);
    REP(i, n) cin >> d[i];
    REP(i, n) {
        REP(j, n) {
            string tmp = d[i] + d[j];
            cout << countForString(tmp) << ' ';
        }
        cout << '\n';
    }
    return 0;
}