#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); 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;

const int mod1 = 1e9 + 7;
const int mod2 = 1e9 + 9;
const LL mod = (LL)mod1 * mod2;
const int P = 474747;

LL add(LL a, LL b)
{
	return a + b < mod ? a + b : a + b - mod;
}

__int128 mult(LL a, LL b)
{
	return (__int128)a * b % mod;
}

LL getHash(string s)
{
	LL res = 0, pw = 1;
	for (char c : s)
	{
		res = add(res, mult(pw, c));
		pw = mult(pw, P);
	}
	return res;
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n;
	cin >> n;
	vector<string> a(n);
	for (string& ai : a)
		cin >> ai;
	for (const string& ai : a)
		cout << ai[0];
	cout << "\n";
	vector<LL> h(n);
	FOR(i, 0, n)
		h[i] = getHash(a[i].substr(0, 3 * n - 1));
	FOR(i, 0, n)
	{
		LL cur = getHash(a[i].substr(1, 3 * n - 1));
		int x = -1;
		FOR(j, 0, n)
		{
			if (cur == h[j])
				x = j;
		}
		assert(x != -1);
		cout << x + 1 << " ";
	}
	cout << "\n";
	return 0;
}