import java.util.*;
import java.io.*;
import java.math.BigInteger;
 
public class Main {
	public static long mod = 1000000007;
	
	public static void main(String[] args) {
	Scanner s = new Scanner(System.in);
	int N = s.nextInt();
	boolean is = false;
	int[][] D = new int[N][2];
	for(int i = 0; i < N; i++){
		D[i][0] = s.nextInt();
		D[i][1] = s.nextInt();
	}

	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])){
			is = true;
		}
	}
	if(is){
		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