Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

A. Chess For Three

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputAlex, 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.

Examples

Input

3

1

1

2

Output

YES

Input

2

1

2

Output

NO

Note

In the first example the possible situation is:

- Alex wins, Carl starts playing instead of Bob;
- Alex wins, Bob replaces Carl;
- Bob wins.

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

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/18/2018 02:43:32 (f1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|