#include <bits/stdc++.h>

using namespace std;

const int N = 2005;

int G[N][N];

signed main() {
    int n; scanf("%d", &n);
    for (int i = 2; i <= n; ++i) {
        string S; cin >> S, S = ' ' + S;
        for (int j = 1; j < i; ++j) G[i][j] = G[j][i] = (S[j] == 'R');
    }
    for (int i = 1; i <= n; ++i) {
        vector<int> v1 = {i}, v2;
        for (int j = 1; j <= n; ++j) {
            if (j == i) continue;
            if (v2.empty()) {
                if (v1.size() == 1 || G[v1[0]][v1[1]] == G[v1.back()][j]) v1.push_back(j);
                else v2.push_back(j);
            } else {
                if (G[v1.back()][j] == G[v1[0]][v1[1]]) {
                    if (G[v2.back()][j] == !G[v1[0]][v1[1]]) v1.push_back(j);
                    else v1.push_back(j), v1.push_back(v2.back()), v2.pop_back();
                } else {
                    if (G[v1.end()[-2]][j] == G[v1[0]][v1[1]]) v2.push_back(v1.back()), v1.back() = j;
                    else v2.push_back(v1.back()), v2.push_back(j), v1.pop_back();
                    if (v1.size() == 1) v1.insert(v1.end(), v2.rbegin(), v2.rend()), v2.clear();
                }
            }
        }
        printf("%d\n", n);
        v1.insert(v1.end(), v2.rbegin(), v2.rend());
        for (int j = 0; j < n; ++j) printf("%d%c", v1[j], " \n"[j + 1 == n]);
    }
    return 0;
}