codeforces 998-Cvacations 思路题

. 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

Copy

4
1 3 2 0

output

Copy

2

input

Copy

7
1 3 3 2 1 2 3

output

Copy

0

input

Copy

2
2 2

output

Copy

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.

思路：

假设我们用数组a来存Vasya的计划，那么对于Vasya的任意一天ai，如果ai = 1且前一天也是1，那么vasya将会得到一天的休息，这一天ai就相当于是0了，我们于是把ai=0，对于ai=2也同理，如果ai=3,且前一天等于1或2，那么我们把这一天变成2或1，即这一天不会得到休息，ok

你也许还会有疑问，如果前一天为0，且这一天为3时怎么办，我们并没有做任何处理啊，其实你可以仔细想想，如果前一天为0，且以后不管有多少3连着，其实vasya也是不会得到休息的，以为这样我们从后面为1或2往前推都是可以打比赛或是运动的，所以并不做处理也不会影响到后面的数据

代码：

#include<bits/stdc++.h>
int a[1005];
int main()
{
    int n,temp,ans,j;
    scanf("%d",&n);
    for (int i = 0;i < n;i ++)
        scanf("%d",&a[i]);
    temp = a[0];
    ans = a[0] ? 0 : 1;
    for (int i = 1;i < n;i ++)
    {
        if (a[i] == 1 && a[i - 1] == 1)
            a[i] = 0,ans ++;
        else if (a[i] == 2 && a[i - 1] == 2)
            a[i] = 0,ans ++;
        else if (a[i] == 3)
        {
            if (a[i - 1] == 1)
                a[i] = 2;
            else if (a[i - 1] == 2)
                a[i] = 1; 
        
        }
        else if (a[i] == 0) ans ++;
    }
    printf("%d\n",ans);
    return 0;
}