#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

template<class V> class MaxFlow_dinic {
public:
	struct edge { int to,reve;V cap;};
	static const int MV = 10100;
	vector<edge> E[MV];
	int itr[MV],lev[MV];
	void add_edge(int x,int y,V cap,bool undir=false) {
		E[x].push_back((edge){y,(int)E[y].size(),cap});
		E[y].push_back((edge){x,(int)E[x].size()-1,undir?cap:0});
	}
	void bfs(int cur) {
		MINUS(lev);
		queue<int> q;
		lev[cur]=0;
		q.push(cur);
		while(q.size()) {
			int v=q.front(); q.pop();
			ITR(e,E[v]) if(e->cap>0 && lev[e->to]<0) lev[e->to]=lev[v]+1, q.push(e->to);
		}
	}
	V dfs(int from,int to,V cf) {
		if(from==to) return cf;
		for(;itr[from]<E[from].size();itr[from]++) {
			edge* e=&E[from][itr[from]];
			if(e->cap>0 && lev[from]<lev[e->to]) {
				V f=dfs(e->to,to,min(cf,e->cap));
				if(f>0) {
					e->cap-=f;
					E[e->to][e->reve].cap += f;
					return f;
				}
			}
		}
		return 0;
	}
	V maxflow(int from, int to) {
		V fl=0,tf;
		while(1) {
			bfs(from);
			if(lev[to]<0) return fl;
			ZERO(itr);
			while((tf=dfs(from,to,numeric_limits<V>::max()))>0) fl+=tf;
		}
	}
};


int N;
string S[101010];
int A[101010][3];
MaxFlow_dinic<int> mf;
string SS[52];

char toto(int a) {
	if(a<26) return 'a'+a;
	return 'A'+a-26;
}
void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	FOR(i,N) {
		cin>>S[i];
		FOR(x,3) {
			if(S[i][x]>='a' && S[i][x]<='z') A[i][x]=S[i][x]-'a';
			if(S[i][x]>='A' && S[i][x]<='Z') A[i][x]=S[i][x]-'A'+26;
		}
	}
	
	if(2*N>52+52*52) return _P("Impossible\n");
	
	FOR(i,52) mf.add_edge(2000+i,2100+i,1);
	//FOR(i,52) FOR(x,52*52) mf.add_edge(2100+i,3000+x,1);
	FOR(x,52*52) mf.add_edge(3000+x,6000+x,1);
	
	FOR(i,N) {
		mf.add_edge(0,100+i,1);
		
		mf.add_edge(100+i,2000+A[i][0],1);
		mf.add_edge(2100+A[i][0],3000+A[i][1]*52+A[i][2],1);
		mf.add_edge(6000+A[i][1]*52+A[i][2],1,1);
		
		mf.add_edge(100+i,2000+A[i][2],1);
		mf.add_edge(2100+A[i][2],3000+A[i][0]*52+A[i][1],1);
		mf.add_edge(6000+A[i][0]*52+A[i][1],1,1);
	}
	if(mf.maxflow(0,1)!=N) return _P("Impossible\n");
	FOR(i,52) {
		FORR(e,mf.E[2100+i]) if(e.to>=3000 && e.cap==0) {
			SS[i]=toto((e.to-3000)/52);
			SS[i]+=toto((e.to-3000)%52);
		}
	}
	
	FOR(i,N) {
		if(S[i].substr(1,2)==SS[A[i][0]]) {
			cout<<S[i].substr(0,1)<<" "<<S[i].substr(1,2)<<endl;
			SS[A[i][0]]="";
		}
		else {
			cout<<S[i].substr(0,2)<<" "<<S[i].substr(2,1)<<endl;
			SS[A[i][2]]="";
		}
	}
	
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n';
	FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	solve(); return 0;
}