#include <bits/stdc++.h>
using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, b, a) for(int i = (b) - 1; i >= (a); i--)
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

int n;
vector<string> g;

bool ok(const VI& a)
{
	int mx = 0;
	FOR(i, 0, SZ(a))
	{
		int cur = a[i];
		int nx = a[(i + 1) % SZ(a)];
		
		int val = g[cur][nx] - '0';
		//cerr << val << "\n";
		if(val < mx)
			return 0;
		mx = max(mx, val);
	}
	return 1;
}

void solve()
{
	g.resize(n);
	FOR(i, 0, n)
		cin >> g[i];
	
	
	VI ans = {0, 1, 2};
	if(!ok(ans))
		ans = {1, 2, 0};
	if(!ok(ans))
		ans = {2, 0, 1};
	assert(ok(ans));
	
	//FOR(i, 0, 3)
	//	cerr << ans[i] << " ";
	//cerr << "\n";


	FOR(i, 3, n)
	{
		VI cands = {0, i};
		FOR(j, 0, i)
		{
			int pr = ans[(j + i - 1) % i];
			int cur = ans[j];
			int nx = ans[(j + 1) % i];

			if(g[cur][pr] == g[cur][nx])
				continue;
			
			cands.PB(j);
			cands.PB(j + 1);
		}
		
		bool find = 0;
		for(int pos : cands)
		{
			if(find)
				break;
				
			VI nans = ans;
			nans.insert(nans.begin() + pos, i);
			
			FOR(t, 0, 2)
			{
				if(ok(nans))
				{
					ans = nans;
					find = 1;
					break;
				}
				int v = nans.back();
				nans.pop_back();
				nans.insert(nans.begin(), v);
			}
		}
		assert(SZ(ans) == i + 1);
	}
	
	
	
	FOR(i, 0, n)
	{
		if(i)
			cout << " ";
		cout << ans[i] + 1;
	}
	cout << "\n";
	//cerr << "\n";
}


int main()
{
	ios::sync_with_stdio(0); 
	cin.tie(0);
	
	while(cin >> n)
		solve();
	
	

	return 0;
}