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

直接暴力求解，也可以用贪心思想，但就我看到的代码而言，其实和这个没差，只是每个人自己认为的不一样。

当然，还可以用DP求解，比较麻烦，需要状态转移，本质一样。

你只需要关注前一天的情况，用k记录，来确定这一天的情况；如果k是3，且前一天的前一天是0，那就有点特殊了，他看的是后一天的情况，来确定今天的情况。其实就是都能选，咱们不用管它具体选的啥，只需要知道这一天不能休息就ok了。其他的就一点一点看。

有空再补下dp的吧～

 

#include<iostream>

using namespace std;
int a[110];
int main(){
	int n;
	cin>>n;
	int i;
	for(i=0;i<n;i++){
		cin>>a[i];
	}
	int k=0,ans=0;
	for(i=0;i<n;i++){
		if(a[i]==0){
			k=0;ans++;
		}
		else{ 
			if(a[i]==3)	k=3-k;
			else{ 
				if(a[i]==k){	k=0;ans++;	}
				else k=a[i];
			}
		}
	}
	cout<<ans<<endl;
	return 0;
}