Chess For Three

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 ai (1 ≤ ai ≤ 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:

  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.

题意:三人一起玩游戏,先两人比较,第三人做裁判,输家和裁判交换,求所给的比赛结果是否合理代码:
#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
using namespace std;
int arr[105];
int getLost(int A,int C){//根据赢家和裁判,输出输家 
    if(A==1&&C==2||A==2&&C==1) return 3;
    if(A==3&&C==2||A==2&&C==3) return 1;
    if(A==1&&C==3||A==3&&C==1) return 2;
}
int main(){
	int n;
	cin>>n;
	for(int i=0;i<n;i++)
	cin>>arr[i];
	int flag=1;
	int A,B,C=3;
	for(int i=0;i<n;i++){
	    if(arr[i]==C){
			flag=0;
			break;
		}
		A=arr[i];
		B=getLost(A,C);
		C=B;//下一局的裁判 
	}
	if(flag) cout<<"YES"<<endl;
	else cout<<"NO"<<endl;
	return 0;
}


  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值