Vacations（DP）

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 thisn days: whether that gym opened and whether a contest was carried out in the Internet on that day. For thei-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 a₁, a₂, ..., a_n (0 ≤ a_i ≤ 3) separated by space, where:

• a_i equals 0, if on thei-th day of vacations the gym is closed and the contest is not carried out;
• a_i equals 1, if on thei-th day of vacations the gym is closed, but the contest is carried out;
• a_i equals 2, if on thei-th day of vacations the gym is open and the contest is not carried out;
• a_i equals 3, if on thei-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.

Example

Input

41 3 2 0

Output

2

Input

71 3 3 2 1 2 3

Output

0

Input

22 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.

题意：

Vasya在n天中，有三件事情可以做，健身、写作或者休息，

但是健身和写作不能连续两天都去做，但是连续休息两天是允许的，

问题是在这n天中，Vasya最少可以休息几天？

状态转移方程 dp【第i天】【做的事情】=min（dp【第i-1天】【与今天做的不同事情】）

代码：

#include<stdio.h>#include<algorithm>#include<string.h>#define Inf 0x3f3f3f3fusing namespace std;int minn(int a,int b,int c){    a=min(a,b);    a=min(a,c);    return a;}int dp[105][4]; //dp[i][j]第i天进行j活动的情况下的前i天的最少休息日的数量,j为0，1，2int main(){     //0:休息 1:做IT 2:做sport    int n;    scanf("%d",&n);    int i;    memset(dp,Inf,sizeof(dp));    dp[0][0]=0;    for(i=1;i<=n;i++){        int m;        scanf("%d",&m);        dp[i][0]=minn(dp[i-1][0],dp[i-1][1],dp[i-1][2])+1;        if(m==1) dp[i][1]=min(dp[i-1][0],dp[i-1][2]);        else if(m==2) dp[i][2]=min(dp[i-1][0],dp[i-1][1]);        else if(m==3){            dp[i][1]=min(dp[i-1][0],dp[i-1][2]);            dp[i][2]=min(dp[i-1][0],dp[i-1][1]);        }    }    int k=minn(dp[n][0],dp[n][1],dp[n][2]);    printf("%d\n",k);return 0;}