Problem:
Score : 200 points

Problem Statement

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.

Sample Input 1

5
1 2
6 6
4 4
3 3
3 2

Sample Output 1

Yes

From the second roll to the fourth roll, three doublets occurred in a row.

Sample Input 2

5
1 1
2 2
3 4
5 5
6 6

Sample Output 2

No

Sample Input 3

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

Sample Output 3

Yes

Solution in Java (OpenJDK 11.0.6) (judge verdict: Wrong Answer)

import java.util.Scanner;
 
public class Main {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
        int attempt = in.nextInt();
        int[][] diceArr = new int[attempt][2];
        for (int i = 0; i < attempt; i++) {
            diceArr[i][0] = in.nextInt();
            diceArr[i][1] = in.nextInt();
        }
        int counter = 0;
        int streak = 1;
        for (int i = 0; i < attempt; i++) {
            if (counter == 3) {
                break;
            } else if (diceArr[i][0] == diceArr[i][1]) {
                counter++;
                streak++;
            } else {
                streak = 0;
            }
        }
        if (streak > 0 && counter >= 3) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
        
        in.close();
    }
}