#include // #include #define int long long #define inf 1000000007 #define pa pair #define ll long long #define pal pair #define ppap pair #define PI 3.14159265358979323846 #define paa pair #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 (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 (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 (const pa2 &p) const{ return x != p.x ? x 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))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,greater> pq; //sort(ve.begin(),ve.end(),greater()); //----------------kokomade tenpure------------ //vector ans(100000000),ans2(100000000) vector ve; vector gr[5100]; vector igr[5100]; vector 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<=0;i--){ idfs(ban[i],ban[i]); } } set se; vector D[3000]; string s[1500]; int w[1500]; int iri[3000]={0}; vector topo; int jun[3000]; signed main(){ cin.tie(0); ios::sync_with_stdio(false); int n; cin>>n; if(n>=1400){ cout<<"Impossible"<>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< 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]