1 #include<cstdio>
 2 #include<cstring>
 3 #include<cstdlib>
 4 #include<queue>
 5 #include<string>
 6 #include<stack>
 7 #include<cmath>
 8 #include<cctype>
 9 #include<iostream>
10 #include<set>
11 #include<algorithm>
12 #include<ctime>
13 #include<vector>
14 using namespace std;
15 #define mem(a) memset(a,0,sizeof(a))
16 #define MAXN 1000007
17 int hash[MAXN],next[MAXN];
18 int snow[100007][6];
19 bool isfind;
20 bool judge(int a,int b)//比较下标为a,b的两片雪花是否相同
21 {
22     int i,j,k;
23     for(i=0;i<6;i++)
24     {
25         for(j=i,k=0;k<6;k++,j=(j+1)%6)//顺时针，有一点点小技巧
26             if(snow[a][k]!=snow[b][j])break;
27         if(k==6)return true;
28         for(j=i,k=0;k<6;k++,j=(j+5)%6)//逆时针
29             if(snow[a][k]!=snow[b][j])break;
30         if(k==6)return true;
31     }
32     return false;
33 }
34
35 bool try_to_insert(int a[],int index)
36 {
37     int i,u;
38     int x=0;
39     for(i=0;i<6;i++)//哈希    采用平方取模的方法
40         x=(int)((((long long)a[i]*(long long)a[i])+x)%MAXN);
41     u=hash[x];//hash里面放的是index，即数组的下标，x作为下标，可用于快速查找
42     while(u)
43     {
44         if(judge(index,u))return false;
45         u=next[u];
46     }
47     next[index]=hash[x];//把下标用next链接起来
48     hash[x]=index;//新的下标作为表头
49     return true;
50 }
51 int main()
52 {
53     int n,j,i;
54     while(~scanf("%d",&n))
55     {
56         for(i=1;i<=n;i++)
57             for(j=0;j<6;j++)
58                 scanf("%d",&snow[i][j]);
59         isfind=false;
60         mem(next);mem(hash);i=1;
61         while(try_to_insert(snow[i],i)&&i<=n)
62         {
63             i++;
64         }
65         if(i==n+1)printf("No two snowflakes are alike.\n");
66         else printf("Twin snowflakes found.\n");
67     }
68     return 0;
69 }