#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define all(a) begin(a),end(a)
#define sz(a) (int)(a).size()
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
int main(){
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);
	int M;cin>>M;
	vector<int>A(M),B(M),C(M);
	rep(i,0,M)cin>>A[i]>>B[i]>>C[i];
	{
		set<pair<int,pii>>S;
		rep(i,0,M)S.insert(make_pair(A[i],pii(B[i],C[i])));
		if(sz(S)<M){cout<<"NO"<<endl;return 0;}
	}
	vector<pii>E;
	rep(i,0,M){
		E.emplace_back(pii(A[i],B[i]));
		E.emplace_back(pii(B[i],C[i]));
		E.emplace_back(pii(A[i],C[i]));
	}
	sort(all(E));
	E.erase(unique(all(E)),E.end());
	int L=sz(E);
	vector<vector<int>>F(L);
	rep(i,0,M){
		F[lower_bound(all(E),pii(A[i],B[i]))-E.begin()].emplace_back(i);
		F[lower_bound(all(E),pii(B[i],C[i]))-E.begin()].emplace_back(i);
		F[lower_bound(all(E),pii(A[i],C[i]))-E.begin()].emplace_back(i);
	}
	vector<vector<pair<int,bool>>>es(M);
	rep(i,0,L)rep(j,0,sz(F[i])-1){
		if(sz(F[i])>2){cout<<"NO"<<endl;return 0;}
		int u=F[i][j],v=F[i][j+1];
		bool inv;
		if(A[u]==A[v]){
			if(B[u]==B[v]||C[u]==C[v])inv=1;
			else inv=0;
		}
		else if(A[u]==B[v]){
			if(B[u]==C[v])inv=1;
			else inv=0;
		}
		else if(B[u]==B[v])inv=1;
		else if(B[u]==A[v]){
			if(C[u]==B[v])inv=1;
			else inv=0;
		}
		es[u].emplace_back(make_pair(v,inv));
		es[v].emplace_back(make_pair(u,inv));
	}
	bool ok=1;
	vector<bool>pot(M),seen(M);
	function<void(int)>dfs=[&](int v){
		seen[v]=1;
		for(auto[u,b]:es[v]){
			if(!seen[u]){pot[u]=(pot[v]^b);dfs(u);}
			else if(pot[u]!=(pot[v]^b))ok=0;
		}
	};
	rep(i,0,M)if(!seen[i])dfs(i);
	if(ok)cout<<"YES"<<endl;
	else cout<<"NO"<<endl;
}