#include <set>

#include <map>

#include <cmath>

#include <queue>

#include <vector>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <iostream>

#include <algorithm>

using namespace std;

struct node{

    int a,b,c,d,e,f,hash;

    node(int a,int b,int c,int d,int e,int f):a(a),b(b),c(c),d(d),e(e),f(f){}

    bool operator<(const node&x)const{

        if(a==x.a&&b==x.b&&c==x.c&&d==x.d&&e==x.e)return f<x.f;

        if(a==x.a&&b==x.b&&c==x.c&&d==x.d)return e<x.e;

        if(a==x.a&&b==x.b&&c==x.c)return d<x.d;

        if(a==x.a&&b==x.b)return c<x.c;

        if(a==x.a)return b<x.b;

        return a<x.a;

    }

};

set<node>s;

int n,l[];

int main(){

    scanf("%d",&n);

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

        scanf("%d%d%d%d%d%d",&l[],&l[],&l[],&l[],&l[],&l[]),sort(l,l+);

        node snow=node(l[],l[],l[],l[],l[],l[]);

        if(s.find(snow)!=s.end()){puts("Twin snowflakes found.");return ;}

        s.insert(snow);

    }

    puts("No two snowflakes are alike.");

    return ;

}