CF 363.div2 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 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.

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.

题目大意是，一个工作者在假期，每一天有四种情况，0是说只能休息，1是只能工作，2是只能运动，3是可以工作也可以运动，要求连续两天不能做同样的事情，试求最小的休息天数（全部都休息就GG了）

如果是对着数据来查错，确实很简单，但是这样以后自己遇到这种问题还是想不出来，以后还是按照acm赛制来写题吧，这道题我确实是完全按照数据来查错的。

代码如下：

#include<stdio.h>
int main()
{
	int rest,a[105],n,i;
	while(scanf("%d",&n)!=EOF)
	{
		for(i=0;i<n;i++)
			scanf("%d",&a[i]);
		rest=0;
		i=0;
		if(a[i]==0)
			rest++;
		else if(a[i]==3)
		{
			while(a[i]==3&&i<n)
				i++;
			if(i<n&&a[i]==0)
			{
				rest++;
			}
		}
			
		for(i++;i<n;i++)
		{
			if(a[i]==0)
			{
				rest++;
			}
			else if(a[i]==1)
			{
				if(a[i-1]==1)
				{
					a[i]=0;
					rest++;
				}
			}
			else if(a[i]==2)
			{
				if(a[i-1]==2)
				{
					a[i]=0;
					rest++;
				}
			}
			else
			{
				if(a[i-1] == 1)
					a[i]=2;
				else if(a[i-1] == 2)
					a[i]=1;
				else
				{
					while(a[i]==3&&i<n)
						i++;
					if(i<n&&a[i]==0)
					{
						rest++;
					}
				}
			}
		}
		printf("%d\n",rest);
	}
}

虽然说思路大致方向是对的，不过还是不够，这道题来说，3是个神奇的存在，这道题应该算是贪心的题目，3可能照顾了前面，那就会忽略后面，照顾后面，就忽略了前面，所以我是采用照顾前面的方法来写的，前面是1，那么3变2，前面是2，那么3变1，让后面的数字来承担这样改变的后果，只放眼于当前最优解，这就是贪心。如果前面是0，当前数字是3，那么可以用while循环直接向后找到不是3的数，例如0333332，33333是肯定可以凑出一个和2匹配可行的方案的，所以不用管，要注意的是，如果是033330，那么我这种写法会直接跳过0的判断，所以要在循环后当前就判断一次是不是0,。

我错了三次，分别是因为上面所说的1.如果前面是0，直接循环不管3,

                                                                 2.如果最后一个数字是0，要在当前就判断一次

                                                                  3.很关键的一点，你循环后可能刚好越界了，越界后那个数字是无法确定的，导致输出会有误，所以还要加上i<n这个判断条件