/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author gainullin.ildar
 */

#include <bits/stdc++.h>

#include <cmath>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <list>
#include <time.h>
#include <math.h>
#include <random>
#include <deque>
#include <queue>
#include <cassert>
#include <unordered_map>
#include <iomanip>

using namespace std;


typedef long long ll;
typedef unsigned long long ull;

const int N = 4000 + 7;

int g[N][N];
int deg[N];
int n;

vector<int> rec(int ed)
{
    if (ed == n * (n - 1) / 2)
    {
        vector<int> a(n);
        for (int i = 0; i < n; i++)
        {
            a[i] = i;
        }
        return a;
    }
    else
    {
        int x = -1, y = -1;
        int res = 0;
        for (int i = 0; i < n; i++)
        {
            for (int j = i + 1; j < n; j++)
            {
                if (!g[i][j] && deg[i] + deg[j] > res)
                {
                    x = i, y = j;
                    res = deg[i] + deg[j];
                }
            }
        }
        g[x][y] = g[y][x] = 1;
        auto a = rec(ed + 1);
        int pos = -1;
        for (int i = 0; i < n; i++)
        {
            if ((a[i] == x && a[(i + 1) % n] == y) || (a[i] == y && a[(i + 1) % n] == x))
            {
                pos = i;
                break;
            }
        }
        g[x][y] = g[y][x] = 0;
        if (pos == -1)
        {
            return a;
        }
        else
        {
            rotate(a.begin(), a.begin() + (pos + 1) % n, a.end());
            for (int i = 1; i < n - 2; i++)
            {
                if (g[a[0]][a[i + 1]] && g[a[i]][a[n - 1]])
                {
                    vector<int> ans;
                    ans.push_back(a[0]);
                    ans.push_back(a[i + 1]);
                    for (int j = i + 2; j < n; j++)
                    {
                        ans.push_back(a[j]);
                    }
                    ans.push_back(a[i]);
                    for (int x = i - 1; x > 0; x--)
                    {
                        ans.push_back(a[x]);
                    }
                    return ans;
                }
            }
            assert(0);
        }
    }
}

class Main
{
public:
    void solve(std::istream &in, std::ostream &out)
    {
        srand(time(0));
        in >> n;
        for (int i = 0; i < n; i++)
        {
            for (int j = 0; j < n; j++)
            {
                g[i][j] = 0;
            }
        }
        int ans = 0;
        for (int i = 0; i < n; i++)
        {
            for (int j = 0; j < i; j++)
            {
                char c;
                in >> c;
                g[i][j] = g[j][i] = (c == '1');
                ans += g[i][j];
                deg[i] += g[i][j];
                deg[j] += g[j][i];
            }
        }
        vector<int> res = rec(ans);
        for (int i = 0; i < n; i++)
        {
            out << res[i] + 1 << ' ';
        }
        out << '\n';
    }
};

int main()
{
    ios::sync_with_stdio(0);
    Main solver;
    std::istream &in(std::cin);
    std::ostream &out(std::cout);
    solver.solve(in, out);
    return 0;
}