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
#include<stdio.h>

int main()
{
	int t;
	scanf("%d", &t);
	
	int a, b, cnt = 0, flag = 0;
	
	while(t--)
	{
		scanf("%d %d", &a, &b);
		if(a == b) cnt++;
		else cnt = 0;
		//printf("%d\n ", cnt);
		if(cnt >= 3) flag = 1;
	}
	
	if(flag) printf("Yes\n");
	else printf("No\n");
	return 0;
}