#include<bits/stdc++.h>
#define pd push_back
#define all(A) A.begin(),A.end()
#define lower_bound lb
#define ve std::vector
typedef long long ll;
typedef long long ll;
typedef __int128 Int;
typedef unsigned long long ul;
typedef long double LD;
bool FileIfstream(std::string name){
	std::ifstream f(name.c_str());
	return f.good();
}
namespace Math{
	ll QP(ll x,ll y,ll mod){ll ans=1;for(;y;y>>=1,x=x*x%mod)if(y&1)ans=ans*x%mod;return ans;}
	ll inv(ll x,ll mod){return QP(x,mod-2,mod);}
}
const int N=2e5+10;
const int mod=998244353;
int n;
void solve(){
	//don't forget to open long long
	ve<std::string>v(n+1);
	for(int i=1;i<=n;i++){
		std::cin>>v[i];
		v[i]=" "+v[i];
	}
	ve<int>ans;ans.pd(1);ans.pd(2);
	for(int i=3;i<=n;i++){
		int pos=-1;
		for(int j=0;j+2<ans.size();j++){
			if(v[ans[j]][ans[j+1]]!=v[ans[j+1]][j+2])
				pos=j;
		}
		if(pos==-1)ans.pd(i);
		else{
			if(v[ans[pos]][ans[pos+1]]==v[ans[pos+1]][i])
				ans.insert(ans.begin()+pos,i);
			else ans.insert(ans.begin()+(pos+2),i);
		}
	}
	for(int i=0;i<n;i++)
		std::cout<<ans[i]<<(i==n-1?'\n':' ');
}
int main(){
#ifndef ONLINE_JUDGE
	if(!FileIfstream("IO.in")){
		freopen("IO.in","w",stdout);
		return 0;
	}
	freopen("IO.in","r",stdin);
	freopen("IO.out","w",stdout);
#endif
	std::ios::sync_with_stdio(false);
	std::cin.tie(0);
	std::cout.tie(0);
	int T=1;
	while(std::cin>>n)solve();

	return 0;
}