import java.util.Scanner;

public class Main {
	public static void main(String[]args) {
		try(Scanner scan = new Scanner(System.in)){

			int N = scan.nextInt();
			int[][]D = new int[N][2];
			int[]che = new int[N];


			int count = 0;
			int renzoku = 0;
			for(int i = 0;i<N;i++) {
				D[i][0] = scan.nextInt();
				D[i][1] = scan.nextInt();

				if(D[i][0]==D[i][1]) {
					che[i]++;
				}
			}

			int ok = 0;

			for(int i = 0;i<N-2;i++) {
				if(D[i][0]==D[i][1]&&D[i+1][0]==D[i+1][1]&&D[i+2][0]==D[i+2][1]) {
					ok=1;
				}
			}

			if(ok==1) {
				System.out.println("Yes");
			}else {
				System.out.println("No");
			}




		}


	}




}

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz