#include<bits/stdc++.h>
#define int long long
const int inf=8938103643641919514ll;
const int mod=1000000007;
const int dd[]={0,-1,0,1,0};
using namespace std;
int a,b,c,d;
char p[100000][3];
struct A{
	char c[3];
	bool operator<(const A &x)const{
		if(c[0]<x.c[0])
			return true;
		else if(c[0]>x.c[0])
			return false;
		else
			return c[1]<x.c[1];
	}
	A(){
		c[0]=0;
		c[1]=0;
		c[2]=0;
	}
};
ostream& operator<<(ostream &os,const A &x){
	return os<<x.c;
}
set<A> se;
vector<A> ve;
int nnn;
void saiki(int u){
	if(nnn>6000000){
		cout<<"Impossible"<<endl;
		exit(0);
	}
	nnn++;
	if(u==a){
		for(int i=0;i<a;i++)
			cout<<ve[i*2]<<" "<<ve[i*2+1]<<endl;;
		exit(0);
	}
	A s,t;
	s.c[0]=p[u][0];
	s.c[1]=0;
	t.c[0]=p[u][1];
	t.c[1]=p[u][2];
	if(se.find(s)==end(se)&&se.find(t)==end(se)){
		se.insert(s);
		se.insert(t);
		ve.push_back(s);
		ve.push_back(t);
		saiki(u+1);
		se.erase(s);
		se.erase(t);
		ve.resize(ve.size()-2);
	}
	if(p[u][0]==p[u][1]&&p[u][1]==p[u][2])
		return;
	s.c[0]=p[u][0];
	s.c[1]=p[u][1];
	t.c[0]=p[u][2];
	t.c[1]=0;
	if(se.find(s)==end(se)&&se.find(t)==end(se)){
		se.insert(s);
		se.insert(t);
		ve.push_back(s);
		ve.push_back(t);
		saiki(u+1);
		se.erase(s);
		se.erase(t);
		ve.resize(ve.size()-2);
	}
}
signed main(){
	int i,j;
	cin>>a;
	for(i=0;i<a;i++)
		cin>>p[i];
	saiki(0);
	cout<<"Impossible"<<endl;
}