#include <bits/stdc++.h>

//    #include <boost/multiprecision/cpp_int.hpp>
 #define int long long
 #define inf  1000000007
 #define pa pair<int,int>
 #define ll long long
 #define pal pair<double,double>
 #define ppap pair<pa,int>
  #define PI 3.14159265358979323846
  #define paa pair<int,char>
  #define  mp make_pair
  #define  pb push_back
  #define EPS (1e-10)
                                          
    int dx[8]={0,1,0,-1,1,1,-1,-1};
    int dy[8]={1,0,-1,0,-1,1,1,-1};
                                            using namespace std;
                                   			class pa3{
                                            	public:
                                            	int x,y,z;
                                            	pa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}
                                            	bool operator < (const pa3 &p) const{
                                            		if(x!=p.x) return x<p.x;
                                            		if(y!=p.y) return y<p.y;
                                            		 return z<p.z;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                   				bool operator > (const pa3 &p) const{
                                            		if(x!=p.x) return x>p.x;
                                            		if(y!=p.y) return y>p.y;
                                            		 return z>p.z;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const pa3 &p) const{
                                            		return x==p.x && y==p.y && z==p.z;
                                            	}
                                            		bool operator != (const pa3 &p) const{
                                            			return !( x==p.x && y==p.y && z==p.z);
                                            	}
                                            
                                            };
                                            
                                            class pa4{
                                            	public:
                                            	int x;
                                            	int y,z,w;
                                            	pa4(int x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}
                                            	bool operator < (const pa4 &p) const{
                                            		if(x!=p.x) return x<p.x;
                                            		if(y!=p.y) return y<p.y;
                                            		if(z!=p.z)return z<p.z;
                                            		return w<p.w;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator > (const pa4 &p) const{
                                            		if(x!=p.x) return x>p.x;
                                            		if(y!=p.y) return y>p.y;
                                            		if(z!=p.z)return z>p.z;
                                            		return w>p.w;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const pa4 &p) const{
                                            		return x==p.x && y==p.y && z==p.z &&w==p.w;
                                            	}
                                            		
                                            
                                            };
                                            class pa2{
                                            	public:
                                            	int x,y;
                                            	pa2(int x=0,int y=0):x(x),y(y) {}
                                            	pa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}
                                            	pa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}
                                            	bool operator < (const pa2 &p) const{
                                            		return y != p.y ? y<p.y: x<p.x;
                                            	}
                                            	bool operator > (const pa2 &p) const{
                                            		return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const pa2 &p) const{
                                            		return abs(x-p.x)==0 && abs(y-p.y)==0;
                                            	}
                                            	bool operator != (const pa2 &p) const{
                                            		return !(abs(x-p.x)==0 && abs(y-p.y)==0);
                                            	}
                                            		
                                            
                                            };
                                            
/*
                                            class Point{
                                            	public:
                                            	double x,y;
                                            	Point(double x=0,double y=0):x(x),y(y) {}
                                            	Point operator + (Point p) {return Point(x+p.x,y+p.y);}
                                            	Point operator - (Point p) {return Point(x-p.x,y-p.y);}
                                            	Point operator * (double a) {return Point(x*a,y*a);}
                                            	Point operator / (double a) {return Point(x/a,y/a);}
                                            	double absv() {return sqrt(norm());}
                                            	double norm() {return x*x+y*y;}
                                            	bool operator < (const Point &p) const{
                                            		return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const Point &p) const{
                                            		return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;
                                            	}
                                            };
                                            typedef Point Vector;
                                     #define pl pair<int,pas>
                                            struct Segment{
                                            Point p1,p2;
                                            };
                                             double dot(Vector a,Vector b){
                                            	return a.x*b.x+a.y*b.y;
                                            }
                                            double cross(Vector a,Vector b){
                                            	return a.x*b.y-a.y*b.x;
                                            }
                                        
                bool parareru(Point a,Point b,Point c,Point d){
                //	if(abs(cross(a-b,d-c))<EPS)cout<<"dd "<<cross(a-b,d-c)<<endl;
                	return abs(cross(a-b,d-c))<EPS;
                }
                double distance_ls_p(Point a, Point b, Point c) {
                  if ( dot(b-a, c-a) < EPS ) return (c-a).absv();
                  if ( dot(a-b, c-b) < EPS ) return (c-b).absv();
                  return abs(cross(b-a, c-a)) / (b-a).absv();
                }
                bool is_intersected_ls(Segment a,Segment b) {
                	if(a.p1==b.p1||a.p2==b.p1||a.p1==b.p2||a.p2==b.p2) return false;
                	if(parareru((a.p2),(a.p1),(a.p1),(b.p2))&&parareru((a.p2),(a.p1),(a.p1),(b.p1))){
                //		cout<<"sss"<<endl;
                		if(dot(a.p1-b.p1,a.p1-b.p2)<EPS) return true;
                		if(dot(a.p2-b.p1,a.p2-b.p2)<EPS) return true;
                		if(dot(a.p1-b.p1,a.p2-b.p1)<EPS) return true;
                		if(dot(a.p1-b.p2,a.p2-b.p2)<EPS) return true;
                		return false;
                	}
                  else return ( cross(a.p2-a.p1, b.p1-a.p1) * cross(a.p2-a.p1, b.p2-a.p1) < EPS ) && ( cross(b.p2-b.p1, a.p1-b.p1) * cross(b.p2-b.p1, a.p2-b.p1) < EPS );
                }
                 
                double segment_dis(Segment a,Segment b){
                	if(is_intersected_ls(a,b))return 0;
                	double r=distance_ls_p(a.p1, a.p2, b.p1);
                	r=min(r,distance_ls_p(a.p1, a.p2, b.p2));
                	r=min(r,distance_ls_p(b.p1, b.p2, a.p2));
                	r=min(r,distance_ls_p(b.p1, b.p2, a.p1));
                	return r;
                }
                Point intersection_ls(Segment a, Segment b) {
                  Point ba = b.p2-b.p1;
                  double d1 = abs(cross(ba, a.p1-b.p1));
                  double d2 = abs(cross(ba, a.p2-b.p1));
                  double t = d1 / (d1 + d2);
                 
                  return a.p1 + (a.p2-a.p1) * t;
                }
 */                
                                string itos( int i ) {
                                ostringstream s ;
                                s << i ;
                                return s.str() ;
                                }
                                 
                                int gcd(int v,int b){
                                	if(v>b) return gcd(b,v);
                                	if(v==b) return b;
                                	if(b%v==0) return v;
                                	return gcd(v,b%v);
                                }
                 
                                double distans(double x1,double y1,double x2,double y2){
                                	double rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
                                	return sqrt(rr);
                                	
                                }
                                int mod;
                                
                int pr[500010];
                int inv[500010];
                
                int beki(int wa,int rr,int warukazu){
                	if(rr==0) return 1%warukazu;
                	if(rr==1) return wa%warukazu;
                	wa%=warukazu;
                	if(rr%2==1) return ((ll)beki(wa,rr-1,warukazu)*(ll)wa)%warukazu;
                	ll zx=beki(wa,rr/2,warukazu);
                	return (zx*zx)%warukazu;
                }
    double bekid(double w,int r){
    	if(r==0) return 1.0;
    	if(r==1) return w;
    	if(r%2) return bekid(w,r-1)*w;
    	double f=bekid(w,r/2);
    	return f*f;
    }
                
    			int comb(int nn,int rr){
    				int r=pr[nn]*inv[rr];
    				r%=mod;
    				r*=inv[nn-rr];
    				r%=mod;
    				return r;
    			}
                /*
                void gya(int ert){
                	pr[0]=1;
                	for(int i=1;i<ert;i++){
                		pr[i]=(pr[i-1]*i)%mod;
                	}
                	for(int i=0;i<ert;i++) inv[i]=beki(pr[i],mod-2,mod);
                	
                }
                */
              //   cin.tie(0);
    		//	ios::sync_with_stdio(false);
    			//priority_queue<pa3,vector<pa3>,greater<pa3>> pq;            
                 //sort(ve.begin(),ve.end(),greater<int>());
                                         //----------------kokomade tenpure------------
                //vector<double> ans(100000000),ans2(100000000)

vector<pa> ve;
vector<int> gr[5100];
vector<int> igr[5100];
vector<int> ban;

int V;
int visit[5100]={0},gro[5100]={0};
void addedge(int i,int j){
	gr[i].pb(j);
	igr[j].pb(i);
//	cout<<i-1500<<" "<<j-1500<<endl;
}
void dfs(int i){
	if(visit[i]==0){
		visit[i]=1;
		for(int k=0;k<gr[i].size();k++) dfs(gr[i][k]);
		ban.push_back(i);
	}
}

void idfs(int i,int h){
	if(visit[i]==0){
		visit[i]=1;
		gro[i]=h;
		for(int k=0;k<igr[i].size();k++) idfs(igr[i][k],h);
	}
}

void kyouren(){
	for(int i=0;i<V;i++){
		dfs(i);
	}
	for(int i=0;i<V;i++) visit[i]=0;
	for(int i=V-1;i>=0;i--){
		idfs(ban[i],ban[i]);
	}
}
set<pa> se;
vector<int> D[3000];
string s[1500];
int w[1500];
int iri[3000]={0};
vector<int> topo;
int jun[3000];
  signed main(){
    	       cin.tie(0);
    			ios::sync_with_stdio(false);
  	int n;
  	cin>>n;
  	if(n>=1400){
  		cout<<"Impossible"<<endl;
  		return 0;
  	}
  	for(int i=1;i<=n;i++)cin>>s[i];
  	
  	for(int i=1;i<=n;i++)for(int j=i+1;j<=n;j++){
  		int b=0;
  		if(s[i][0]!=s[j][0] && (s[i][1]!=s[j][1]||s[i][2]!=s[j][2])) b+=2;
  		if(s[i][0]!=s[j][2] && (s[i][1]!=s[j][0]||s[i][2]!=s[j][1])) b+=1;
  		if(s[i][2]!=s[j][0] && (s[i][0]!=s[j][1]||s[i][1]!=s[j][2])) b+=4;
  		if(s[i][2]!=s[j][2] && (s[i][0]!=s[j][0]||s[i][1]!=s[j][1])) b+=8;
  		//cout<<i<<" "<<j<<" "<<b<<endl;
  		if(b==0){
  		cout<<"Impossible"<<endl;
  			return 0;
  		}
  		if(b==1){
  				ve.pb({i,i});
  				ve.pb({-j,-j});
  		}
		
  		if(b==2){
  				ve.pb({i,i});
  				ve.pb({j,j});
  		}
  		if(b==4){
  				ve.pb({-i,-i});
  				ve.pb({j,j});
  		}
  		if(b==8){
  				ve.pb({-i,-i});
  				ve.pb({-j,-j});
  		}
  		
  		if(b==3){
  				ve.pb({i,i});
  		}
  		
  		if(b==9){
  		//	ve.pb(i,i);
  				ve.pb({-j,-j});
  		}
  		
  		if(b==6){
  				ve.pb({j,j});
  		//	ve.pb(-j,-j);
  		}
  		
  		if(b==12){
  				ve.pb({-i,-i});
  		//	ve.pb(-j,-j);
  		}
  		if(b==5){
  				ve.pb({i,j});
  				ve.pb({-i,-j});
  		}
  		if(b==10){
  				ve.pb({i,-j});
  				ve.pb({-i,j});
  		}
  		if(b==7){
  				ve.pb({i,j});
  		}
  		
  		if(b==11){
  				ve.pb({i,-j});
  		}
  		
  		if(b==13){
  				ve.pb({-i,-j});
  		}
  		if(b==14){
  				ve.pb({-i,j});
  		}
  	}
  	for(auto &v:ve){
  		v.first+=1500;
  		v.second+=1500;
  	}
  	for(auto v:ve){
  		if(v.first==v.second){
  			addedge(3000-v.first,v.second);
  		}
  		else{
  			addedge(3000-v.first,v.second);
  		addedge(3000-v.second,v.first);
  		}
  	}
  	V=3000;
  	kyouren();
  //	cout<<endl;
  //	for(int i=1;i<=n;i++)cout<<gro[1500+i]-1500<<" "<<gro[1500-i]-1500<<endl;
  	for(int i=1;i<=n;i++)if(gro[1500-i]==gro[1500+i]){
  	//	cout<<i<<endl;
  		cout<<"Impossible"<<endl;
  			return 0;
  	}
  	
  	for(int i=0;i<3000;i++){
  			for(auto v:gr[i])if(gro[i]!=gro[v])if(se.count({gro[i],gro[v]})==0){
  				D[gro[i]].pb(gro[v]);
  				iri[gro[v]]++;
  			//	cout<<"  "<<gro[i]-1500<<" "<<gro[v]-1500<<endl;
  				se.insert({gro[i],gro[v]});
  			}
  	}
  	queue<int> qu;
  	for(int i=0;i<3000;i++)if(iri[i]==0)qu.push(i);
  	while(qu.size()){
  		int z=qu.front();
  		topo.pb(z);
  		qu.pop();
  		for(auto v:gr[z]){
  			iri[v]--;
  			if(iri[v]==0)qu.push(v);
  		}
  	}
  	for(int i=0;i<3000;i++)jun[topo[i]]=i;
  	
  	for(int i=1;i<=n;i++){
  		int g1=gro[1500+i];
  		int g2=gro[1500-i];
  		if(jun[g1]<jun[g2])w[i]=-1;
  		else w[i]=1;
  		
  		if(w[i]==1) cout<<s[i][0]<<" "<<s[i][1]<<s[i][2]<<endl;
  		else cout<<s[i][0]<<s[i][1]<<" "<<s[i][2]<<endl;
  	}
  	
  	
  }