#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using mint = atcoder::static_modint<998244353>;
// // using mint = atcoder::static_modint<1000000007>;
using ld = long double;
using ll = long long;
#define mp(a,b) make_pair(a,b)
#define rep(i,s,n) for(int i=s; i<(int)n; i++)
const vector<int> dx{1,0,-1,0},dy{0,1,0,-1};

int main(){
    int n;cin >> n;
    vector<vector<int>> V(n,vector<int>(3));
    map<set<int>,vector<int>> E_to_V;
    rep(i,0,n){
        rep(j,0,3)cin >> V[i][j];
        rep(j,0,3){
            set<int> S;
            S.insert(V[i][j]);
            S.insert(V[i][(j+1)%3]);
            E_to_V[S].push_back(i);
        }
    }

    queue<int> Q;
    vector<int> d(n);
    rep(i,0,n)if(d[i]==0){
        Q.push(i);
        d[i]=1;

        while(Q.size()){
            auto x=Q.front();Q.pop();
            rep(i,0,3){
                set<int> S;
                S.insert(V[x][i]);
                S.insert(V[x][(i+1)%3]);
                if(!E_to_V.count(S))continue;
                auto c=E_to_V[S];
                if(c.size()>=3){
                    cout<<"NO\n";
                    return 0;
                }
                if(c.size()==2){
                    int y=c[0];
                    if(x==y)y=c[1];

                    bool same=false;
                    rep(j,0,3)rep(k,0,3){
                        if(V[x][j]==V[y][k] && V[x][(j+1)%3]==V[y][(k+1)%3])same=true;
                    }
                    int newd;
                    if(same)newd=d[x];
                    else newd=-d[x];
                    if(d[y]==0){
                        d[y]=newd;
                        Q.push(y);
                    }
                    else if(d[y]!=newd){
                        cout << "NO\n";
                        return 0;
                    }
                }
            }
        }
    }
    cout << "YES\n";
}