#include <cstdio>

 #include <cstring>

 #include <vector>

 #include <iostream>

 #include <algorithm>

 using namespace std;

 const int maxn = ;

 const int prime = ;

 struct flake

 {

     int arm[];

     bool operator == (const struct flake b) const

     {

         for(int i=;i<;i++)

         {

             int j;

             for(j=;j<;j++)

             {

                 if(arm[(j+i)%] != b.arm[j]) break;

             }

             if(j == ) return true;

         }

         for(int i=;i<;i++)

         {

             int j;

             for(j=;j<;j++)

             {

                 if(arm[(j+i)%] != b.arm[(+(-*j))%]) break;

             }

             if(j == ) return true;

         }

         return false;

     }

 };

 struct flake hashtable[maxn][];

 int Hash(struct flake a)

 {

     int ans=;

     for(int i=;i<;i++)

     {

         ans += a.arm[i]%prime;

     }

     return ans%prime;

 }

 int N;

 int conf[maxn];

 int main()

 {

     while(~scanf("%d",&N))

     {

         flake sn;

         int flag = ;

         memset(conf,,sizeof conf);

         for(int i=;i<N;i++)

         {

             for(int i=;i<;i++) scanf("%d",&sn.arm[i]);

             if(flag) continue;

             int key = Hash(sn);

             //printf("key=%d\n",key);

             for(int i=;i<conf[key];i++)

             {

                 if(hashtable[key][i] == sn) flag = ;

             }

             if(!flag) hashtable[key][conf[key]++] = sn;

         }

         if(flag) printf("Twin snowflakes found.\n");

         else     printf("No two snowflakes are alike.\n");

     }

 }