【Codeforces Round 363 (Div 2) C】【简单DP】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.

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<string>
#include<ctype.h>
#include<math.h>
#include<set>
#include<map>
#include<vector>
#include<queue>
#include<bitset>
#include<algorithm>
#include<time.h>
using namespace std;
void fre() { freopen("c://test//input.in", "r", stdin); freopen("c://test//output.out", "w", stdout); }
#define MS(x,y) memset(x,y,sizeof(x))
#define MC(x,y) memcpy(x,y,sizeof(x))
#define MP(x,y) make_pair(x,y)
#define ls o<<1
#define rs o<<1|1
typedef long long LL;
typedef unsigned long long UL;
typedef unsigned int UI;
template <class T1, class T2>inline void gmax(T1 &a, T2 b) { if (b>a)a = b; }
template <class T1, class T2>inline void gmin(T1 &a, T2 b) { if (b<a)a = b; }
const int N = 0, M = 0, Z = 1e9 + 7, ms63 = 0x3f3f3f3f;
int n;
int f[105][3];
int main()
{
	while (~scanf("%d", &n))
	{
		MS(f, 63); f[0][0] = 0;
		for (int i = 1; i <= n; ++i)
		{
			int x; scanf("%d", &x);
			if (x == 1 || x == 3)//可以参加考试
			{
				f[i][1] = min(f[i - 1][0], f[i - 1][2]);
			}
			if (x == 2 || x == 3)//可以参加运动
			{
				f[i][2] = min(f[i - 1][0], f[i - 1][1]);
			}
			//休息
			f[i][0] = min(f[i - 1][0], min(f[i - 1][1], f[i - 1][2])) + 1;
		}
		int ans = 1e9;
		gmin(ans, f[n][0]);
		gmin(ans, f[n][1]);
		gmin(ans, f[n][2]);
		printf("%d\n", ans);
	}
	return 0;
}
/*
【trick&&吐槽】


【题意】
我们假期放n（100）天假
对于每天，我们可能——
可以（或不可以）参加考试
可以（或不可以）参加运动
可以休息

已知无法连续2天做运动或无法2连续2天考试
我们希望以最少的日期休息，问你最少休息日期。

【类型】
DP

【分析】
显然，我们只要记录前一天的状态做DP即可。

【时间复杂度&&优化】
O（n*3）

*/