#pragma GCC optimize(2)
#pragma GCC optimize(3)
#include <bits/stdc++.h>
using namespace std;

void debug_out() {cerr << endl;}
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T)
{
    cerr << " " << H;
    debug_out(T...);
}
#ifndef ONLINE_JUDGE
    #define debug(...) cerr << "{" << #__VA_ARGS__ << "}:", debug_out(__VA_ARGS__)
#else
    #define debug(...) 42
#endif

int n;

void solve(){
    vector<string> mp(n);
    for (auto &s : mp) cin >> s;
    vector<int> res;
    for (int i = 0; i < n; i += 1) {
        if(res.size() < 2) {
            res.emplace_back(i);
            continue;
        }

        auto cal = [&](vector<int> &res) {
            int diff = 0;
            for (int j = 1; j < res.size(); j += 1) {
                auto c1 = mp[res[j]][res[j - 1]];
                auto c2 = mp[res[j]][res[(j + 1) % res.size()]];
                diff += c1 != c2;
            }
            return diff;
        };
        if(res.size() <= 20) {
            for (int j = 0; i <= res.size(); j += 1) {
                auto t = res;
                t.insert(t.begin() + j, i);
                if(cal(t) <= 1) {
                    res = t;
                    break;
                }
            }
            continue;
        }
        

        auto get = [&](int x) {
            x = (x + int(res.size())) % res.size();
            return res[x];
        };
        
        int diff = cal(res);

        auto check = [&](int pos) {
            pos = (pos + int(res.size())) % res.size();
            int cur = diff;
            auto c1 = mp[get(pos)][get(pos + 1)];
            auto c2 = mp[get(pos - 1)][get(pos)];
            if(pos != 0) cur -= c1 != c2;
            c2 = mp[get(pos + 1)][get(pos + 2)];
            if(pos + 1 != res.size()) cur -= c1 != c2;
            c1 = mp[i][get(pos)];
            c2 = mp[get(pos - 1)][get(pos)];
            if(pos != 0) cur += c1 != c2;
            c1 = mp[i][get(pos + 1)];
            c2 = mp[get(pos + 1)][get(pos + 2)];
            if(pos + 1 != res.size()) cur += c1 != c2;
            c1 = mp[i][get(pos)];
            c2 = mp[i][get(pos + 1)];
            cur += c1 != c2;
            return cur <= 1;
        };

        for (int j = -1; j < int(res.size()); j += 1) {
            if(check(j)) {
                //debug(i, j);
                res.insert(res.begin() + j + 1, i);
                break;
            }
        }
    }

    for (int i = 0; i < n; i += 1) {
        cout << res[i] + 1 << " \n"[i + 1 == n];
    }
}

int main(){
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    while(cin >> n) {
        solve();
    }
    return 0;
}