Codeforces Round #363 (Div. 2) C. Vacations(逻辑运算)

C. Vacations

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Vasya has n days of vacations! So he decided to improve his IT skills and do sport. Vasya knows the following information about each of this n days: whether that gym opened and whether a contest was carried out in the Internet on that day. For the i-th day there are four options:

1. on this day the gym is closed and the contest is not carried out;
2. on this day the gym is closed and the contest is carried out;
3. on this day the gym is open and the contest is not carried out;
4. on this day the gym is open and the contest is carried out.

On each of days Vasya can either have a rest or write the contest (if it is carried out on this day), or do sport (if the gym is open on this day).

Find the minimum number of days on which Vasya will have a rest (it means, he will not do sport and write the contest at the same time). The only limitation that Vasya has — he does not want to do the same activity on two consecutive days: it means, he will not do sport on two consecutive days, and write the contest on two consecutive days.

Input

The first line contains a positive integer n (1 ≤ n ≤ 100) — the number of days of Vasya's vacations.

The second line contains the sequence of integers a1, a2, ..., an (0 ≤ ai ≤ 3) separated by space, where:

• ai equals 0, if on the i-th day of vacations the gym is closed and the contest is not carried out;
• ai equals 1, if on the i-th day of vacations the gym is closed, but the contest is carried out;
• ai equals 2, if on the i-th day of vacations the gym is open and the contest is not carried out;
• ai equals 3, if on the i-th day of vacations the gym is open and the contest is carried out.

Output

Print the minimum possible number of days on which Vasya will have a rest. Remember that Vasya refuses:

• to do sport on any two consecutive days,
• to write the contest on any two consecutive days.

Examples

input

4
1 3 2 0

output

2

input

7
1 3 3 2 1 2 3

output

0

input

2
2 2

output

1

Note

In the first test Vasya can write the contest on the day number 1 and do sport on the day number 3. Thus, he will have a rest for only 2 days.

In the second test Vasya should write contests on days number 1, 3, 5 and 7, in other days do sport. Thus, he will not have a rest for a single day.

In the third test Vasya can do sport either on a day number 1 or number 2. He can not do sport in two days, because it will be contrary to the his limitation. Thus, he will have a rest for only one day.

观察所给数字的二进制为00,01,10,11.其中的1恰好为对应的天数能干的事情。
假设k[i]为第k天应该干的事情

若序列a[]的子序列s[i](L<=i<=R)有连续个3，

1.假设L=1；那么s之前没有数字，s的状态是由R+1位置的数字决定的，但是无论这个数字是什么s序列中都不可能存在休息的天数。所以k[R+1]=k[R]&a[R+1];

2.假设L!=1,那么R+1的状态是由L-1的状态决定的，但s中仍不可能存在休息的天数。所以

k[R+1]=k[L-1]^k[L]^...^k[R](^为异或运算)

再考虑a[]中没有3的情况那么,k[i+1]=a[i+1]^k[i]; 若k[i+1]==3说明其中一定存在10,01那么k[i+1]=k[i]&a[i+1];

若k[i]==0 则说明第i天休息；

<pre name="code" class="cpp">#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
int a[105];
int main()
{
    int n;
    scanf("%d",&n);
    for (int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
    }
    int ans=0;
    int k=a[1];
    if (k==0) ans++;
    for (int i=1;i<n;i++)
    {
        if ((k^a[i+1])!=3&&k!=3&&a[i+1]!=0) k=k^a[i+1];
        else  k=3&a[i+1];
        if (k==0) ans++;
    }
    printf("%d",ans);
}