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;
using System.Collections.Generic;
using System.Text;

namespace AtCoder
{
  class Program
  {
    static void Main(string[] args)
    {
      long mod = 1000000007;
      int N = int.Parse(Console.ReadLine());
      int c = 0;
      for(int i = 0; i < N; i++)
      {
        string[] ss = Console.ReadLine().Split(' ');
        int i1 = int.Parse(ss[0]);
        int i2 = int.Parse(ss[1]);
        if(i1 == i2)
          c++;
        else
          c = 0;
        if(c == 3)
        {
          Console.WriteLine("Yes");
          return;
        }
      }
      Console.WriteLine("No");
      //int N = int.Parse(Console.ReadLine());

      //long[] ns = new long[2001];
      //for(int i = 3; i <= N; i++)
      //{
      //  long x = 1;
      //  for(int j = 3; j <= i - 3; j++)
      //  {
      //    x += ns[j];
      //    x %= mod;
      //  }
      //  ns[i] = x;
      //}

      Console.ReadLine();
    }
    
  }
}