Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}.

Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

Constraints

* 3 \leq N \leq 100
* 1\leq D_{i,j} \leq 6
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


N
D_{1,1} D_{1,2}
\vdots
D_{N,1} D_{N,2}


Output

Print `Yes` if doublets occurred at least three times in a row. Print `No` otherwise.

Examples

Input

5
1 2
6 6
4 4
3 3
3 2


Output

Yes


Input

5
1 1
2 2
3 4
5 5
6 6


Output

No


Input

6
1 1
2 2
3 3
4 4
5 5
6 6


Output

Yes
public class Main {
	public static void main(String[] args) {
		var sc = new java.util.Scanner(System.in);
		var N = sc.nextInt();
		var D = new int[N][];
		for(int i=0;i<N;i++) {
			D[i]=new int[2];
			D[i][0]=sc.nextInt();
			D[i][1]=sc.nextInt();
		}

		var cnt = 0;
		boolean ysFlg=false;
		for(int i=0;i<N;i++) {
			if(isZorome(D[i][0],D[i][1])) {
				cnt++;
			}else {
				cnt=0;
			}
			if(cnt>=3) {
				ysFlg=true;
				break;
			}
		}
		System.out.println((ysFlg)?"Yes":"No");


	}
	private static boolean isZorome(int a,int b) {
		return a==b;
	}
}
