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 (GCC 9.2.1) (judge verdict: Accepted)

#include <stdio.h>
#include <stdlib.h>

#define rep(i, n) for (int i = 0; i < n; i = i + 1)
#define array(N, t) (t*)calloc(N, sizeof(t))
#define ll long long
#define INF ((1LL << 62) - (1LL << 31))
#define max(p, q)((p) > (q) ? (p) : (q))
#define min(p, q)((p) < (q) ? (p) : (q))
#define swap(type, a, b) { type temp = a; a = b; b = temp; }

int N;
int ans = 0;
int cnt = 0;
int D[110][2];

void solve1() {
  rep(i, N) {
    // ゾロ目が連続して3回続いたらゾロ目三回連続フラグを立てる
    if (cnt == 3) {
      ans = 1;
    }
    if (D[i][0] == D[i][1]) {
      // ゾロ目のケース
      if (cnt > 0) {
        // 前回ゾロ目だったら更に1足す
        cnt += 1;
      } else {
        // 前回ゾロ目じゃなかったら1にする
        cnt = 1;
      }
    } else {
      // ゾロ目じゃないケースは0にする
      cnt = 0;
    }
  }
}

void solve2() {
  int renzoku_cnt = 0;
  rep(i, N) {
    int d1 = D[i][0];
    int d2 = D[i][1];

    if (d1 == d2) {
      renzoku_cnt += 1;
    } else {
      renzoku_cnt = 0;
    }

    if (renzoku_cnt == 3) {
      ans = 1;
    }
  }
}

int main() {
  scanf("%d", &N);

  rep(i, N) {
    scanf("%d%d", &D[i][0], &D[i][1]);
  }
  solve2();
  if (ans == 1) {
    puts("Yes");
  } else {
    puts("No");
  }
  return 0;
}