Educational Codeforces Round 33 (Rated for Div. 2)

A. Chess For Three

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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<bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    cin>>n;
    int ans=3;
    for(int i=0; i<n; ++i)
    {
        int x;
        cin>>x;
        if(x==ans)
        {
            cout<<"NO\n";
            return 0;
        }
        ans=6-x-ans;
    }
    cout<<"YES\n";
    return 0;
}

B. Beautiful Divisors

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Recently Luba learned about a special kind of numbers that she calls beautiful numbers. The number is called beautiful iff its binary representation consists of k + 1 consecutive ones, and then k consecutive zeroes.

Some examples of beautiful numbers:

• 12 (110);
• 1102 (610);
• 11110002 (12010);
• 1111100002 (49610).

More formally, the number is beautiful iff there exists some positive integer k such that the number is equal to (2k - 1) * (2k - 1).

Luba has got an integer number n, and she wants to find its greatest beautiful divisor. Help her to find it!

Input

The only line of input contains one number n (1 ≤ n ≤ 105) — the number Luba has got.

Output

Output one number — the greatest beautiful divisor of Luba's number. It is obvious that the answer always exists.

Examples

input

3

output

1

input

992

output

496

 

模拟下就可以了啊

#include<stdio.h>
int main()
{
    int a2[15]={1,2,4,8,16,32,64,128,256,512,1024};
    int a[15],i,n;
    for(i=1;i<10;i++)
    a[i]=(a2[i]-1)*a2[i-1];
    scanf("%d",&n);
    for(i=9;i>=1;i--)
    {
        if(n%a[i]==0)
        {
            printf("%d\n",a[i]);
            break;
        }
    }
    return 0;
}