CodeForces 893A Chess For Three

Description：

Alex, Bob and Carl will soon participate in a team chess tournament. Since they are all in the same team, they have decided to practise really hard before the tournament. But it's a bit difficult for them because chess is a game for two players, not three.

So they play with each other according to following rules:

• Alex and Bob play the first game, and Carl is spectating;
• When the game ends, the one who lost the game becomes the spectator in the next game, and the one who was spectating plays against the winner.

Alex, Bob and Carl play in such a way that there are no draws.

Today they have played n games, and for each of these games they remember who was the winner. They decided to make up a log of games describing who won each game. But now they doubt if the information in the log is correct, and they want to know if the situation described in the log they made up was possible (that is, no game is won by someone who is spectating if Alex, Bob and Carl play according to the rules). Help them to check it!

Input

The first line contains one integer n (1 ≤ n ≤ 100) — the number of games Alex, Bob and Carl played.

Then n lines follow, describing the game log. i-th line contains one integer a_i (1 ≤ a_i ≤ 3) which is equal to 1 if Alex won i-th game, to 2 if Bob won i-th game and 3 if Carl won i-th game.

Output

Print YES if the situation described in the log was possible. Otherwise print NO.

Example

Input

3
1
1
2

Output

YES

Input

2
1
2

Output

NO

Note

In the first example the possible situation is:

1. Alex wins, Carl starts playing instead of Bob;
2. Alex wins, Bob replaces Carl;
3. Bob wins.

The situation in the second example is impossible because Bob loses the first game, so he cannot win the second one.

题目大意：

三个人玩n轮游戏， 游戏规则是刚开始时第一个人先跟第二个人pk， 输的一方要等一个回合才能继续跟胜者进行pk。 1 2 3代表第1 2 3 个人， 给出n回合胜出者的序号， 判断是否符合游戏规则。

解题思路：

模拟， 对于输了的一个方是不可以进行下一轮的比赛的， 判断是否符合条件即可。（代码写的很啰嗦， 可以进行缩减。）

代码：

#include <iostream>
#include <sstream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <utility>
#include <string>
#include <cmath>
#include <vector>
#include <bitset>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>

using namespace std;

/*
 *ios::sync_with_stdio(false);
 */

typedef long long ll;
typedef unsigned long long ull;
const int dir[5][2] = {0, 1, 0, -1, 1, 0, -1, 0, 0, 0};
const ll ll_inf = 0x7fffffff;
const int inf = 0x3f3f3f;
const int mod = (int)1e9 + 7;
const int Max = (int) 1e5 + 7;

int n, a, b, c;

int main() {
    //freopen("input.txt", "r", stdin);
    int flag = 0, last;
    a = b = c = 1;
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i) {
        int x;
        scanf("%d", &x);
        if (i == 1 && x == 3) {
            flag = 1;
        }
        if (x == 1) {
            if (a == 0) flag = 1;
            if (b == 0 && c == 1) {
                c = 0;
                b = 1;
            } else if (b == 1 && c == 1) {
                b = 0;
            } else if (c == 0 && b == 1) {
                b = 0;
                c = 1;
            } else flag = 1;
            a = 1;
        }
        if (x == 2) {
            if (b == 0) flag = 1;
            if (a == 1 && c == 0) {
                a = 0;
                c = 1;
            } else if (c == 1 && a == 1) {
                a = 0;
            } else if (c == 1 && a == 0) {
                a = 1;
                c = 0;
            } else flag = 1;
            b = 1;
        }
        if (x == 3) {
            if (c == 0) flag = 1;
            if (a == 1 && b == 1) {
                a = 0;
            } else if (a == 0 && b == 1) {
                a = 1;
                b = 0;
            } else if (b == 0 && a == 1) {
                a = 0;
                b = 1;
            } else flag = 1;
            c = 1;
        }
    }
    if (!flag) {
        printf("YES\n");
    } else {
        printf("NO\n");
    }
    return 0;
}