using System; using static System.Console; using System.Linq; using System.Collections.Generic; class Program { static int NN => int.Parse(ReadLine()); static int[] NList => ReadLine().Split().Select(int.Parse).ToArray(); static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray(); public static void Main() { Solve(); } static void Solve() { var n = NN; var map = NArr(n); var dic = new Dictionary(); var count = 0; foreach (var edge in map) { var key1 = GetKey(edge[0], edge[1]); if (!dic.ContainsKey(key1)) dic[key1] = count++; var key2 = GetKey(edge[2], edge[3]); if (!dic.ContainsKey(key2)) dic[key2] = count++; } var tree = new List<(int id, int to)>[count]; for (var i = 0; i < count; ++i) tree[i] = new List<(int id, int to)>(); for (var i = 0; i < n; ++i) { var edge = map[i]; var key1 = GetKey(edge[0], edge[1]); var key2 = GetKey(edge[2], edge[3]); tree[dic[key1]].Add((i, dic[key2])); tree[dic[key2]].Add((i, dic[key1])); } var visited = new bool[count]; var used = new bool[n]; for (var i = 0; i < count; ++i) if (!visited[i]) { var loopcount = 0; OrderGraph(i, -1, tree, visited, used, ref loopcount); if (loopcount > 1) { WriteLine("NO"); return; } } WriteLine("YES"); } static void OrderGraph(int cur, int prev, List<(int id, int to)>[] tree, bool[] visited, bool[] used, ref int loopcount) { visited[cur] = true; foreach (var next in tree[cur]) { if (prev == next.to) continue; if (used[next.id]) continue; used[next.id] = true; if (!visited[next.to]) OrderGraph(next.to, cur, tree, visited, used, ref loopcount); else ++loopcount; } } static int GetKey(int x, int y) { return x * 1000 + y; } }