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 C# (.NET Core 3.1.201) (judge verdict: Accepted)

using System;

class A{
  static void Main(){
    int N = int.Parse(Console.ReadLine());
    int temp = 0;
    string isthis = "No";
    int[] inp = new int[2];
    for (int i = 0; i < N; i++){
      inp = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);
      if (inp[0] == inp[1]){
        temp += 1;
      }
      else temp = 0;
      if (temp >= 3) {
        isthis = "Yes";
        break;
      }
      
    }
    Console.WriteLine(isthis);
  }
}