贪心算法——Vacations

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 a₁, a₂, ..., a_n (0 ≤ a_i ≤ 3) separated by space, where:

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

Example

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.

题目翻译：小v暑假想锻炼身体和提高自己编程能力，当然还要休息。如果输入是0，表示这一天要休息，1表示要写代码，2表示要锻炼身体，3表示既可以锻炼身体又可以写代码，但是他不能连续两天写代码也不能连续两天锻炼身体。问他最少休息几天。

这道题的思路很简单，就是判断有误连续的1或2，然后3要注意一下。刚开始做时没有仔细的思考，认为如果3排在首位可能就有不同的情况，然后就按照这个思路一直做下去虽然最后样例过了，但提交上去还是wa，以下是wa代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int day[10010];
int solve(int k,int n,int a[]){
	a[0]=k;
	int ans=0;
	int rest1,rest2;
	for(int i=0;i<n;i++){
		if(a[i]==0) ans++;
		else if(a[i]==1||a[i]==2){
			//if(i==0) continue;
				if(a[i]==a[i+1]){
					ans++;
					a[i]=4;
				}
			}	
		else if(a[i]==3){
			if(a[i+1]==1) a[i]=2;
			else if(a[i+1]==2) a[i]=1;
		}
	}
	//if(a[0]==0) ans++;
	return ans;
}
int main(){
	int n;
	while(scanf("%d",&n)!=EOF){
		for(int i=0;i<n;i++){
			scanf("%d",&day[i]);
		}
		int rest1=0,rest2=0,rest=0;
		if(day[0]==3){
			rest1=solve(1,n,day); /*此处做法也有错误，经过第一次solve函数处理数组day会发生改变，

第二次solve使用的数据就不对了。
			rest2=solve(2,n,day);
			if(rest1<rest2) printf("%d\n",rest1);
			else printf("%d\n",rest2);
		}
		else{
			rest=solve(day[0],n,day);
			printf("%d\n",rest);
		}
	}
	return 0;
}

后来仔细想了一下，如果开始数字是3完全不需要考虑这么多，只要开头数字是3无论有几个他都一定会有事做不会休息，所以3的影响不大。以下是ac代码。

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int main(){
	int day[10010];
	int n;
	while(scanf("%d",&n)!=EOF){
		memset(day,0,sizeof(day));
		int rest=0;
		for(int i=0;i<n;i++) scanf("%d",&day[i]);
		for(int i=0;i<n;i++){
			if(day[i]==0) rest++;
			else if(day[i]==1){
				if(day[i+1]==3) day[i+1]=2;
				else if(day[i+1]==1) day[i+1]=0; 
			}
			else if(day[i]==2){
				if(day[i+1]==3) day[i+1]=1;
				else if(day[i+1]==2) day[i+1]=0;
			}
		}
		printf("%d\n",rest);
	}
	return 0;
}