#include #include #include #define R register int #define uLL long long int n,t,p=13333331,re,A[13]; std::mappan; inline int sakura(int a[]){ R i=1,j=2,k; while(i<=6&&j<=6){ k=0; while(k<6&&a[i+k]==a[j+k])++k; if(k==6)break; if(a[i+k]>a[j+k]){i+=k+1;if(i==j)++i;} else{j+=k+1;if(i==j)++j;} } return ib[y+i])return Hash(b,y); return Hash(a,x); } int main(){ scanf("%d",&n);R i,j; for(i=1;i<=n;i++){ for(j=1;j<=6;j++)scanf("%d",&A[j]); uLL re=find(A); if(pan[re]){printf("Twin snowflakes found.");return 0;} pan[re]=1; } printf("No two snowflakes are alike."); }