Codeforces Round #363 C (Div

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_1, _a_2, …, 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.

本题的题意是给出n天假期，每天的数字代表每天这个人可以做的事情。

当为0时这天没事干就去休息，为1时可以去做测试，为2时可以去锻炼，为3时可以锻炼可以做测试。

但这个人不能连续两天做同一件事，求出这段假期里这个人最少能休息多少天。

这是一个动态规划题，设出dp[i][j]  其中i代表第i天，j代表这天做的事情为0（休息） 1（做测试） 2（锻炼）

dp[i][j]代表这个人在第i天做j的话能休息最少的天数

算出每天做每件事能休息的最少天数

代码如下：

#include

#include

#include

#include

using namespace std;

#define N 105

#define M 1e9

int dp[N][N],a[N];

int main()

{

最后

自我介绍一下，小编13年上海交大毕业，曾经在小公司待过，也去过华为、OPPO等大厂，18年进入阿里一直到现在。

深知大多数初中级Android工程师，想要提升技能，往往是自己摸索成长，自己不成体系的自学效果低效漫长且无助。

因此我收集整理了一份《2024年Android移动开发全套学习资料》，初衷也很简单，就是希望能够帮助到想自学提升又不知道该从何学起的朋友，同时减轻大家的负担。

既有适合小白学习的零基础资料，也有适合3年以上经验的小伙伴深入学习提升的进阶课程，基本涵盖了95%以上Android开发知识点！不论你是刚入门Android开发的新手，还是希望在技术上不断提升的资深开发者，这些资料都将为你打开新的学习之门

如果你觉得这些内容对你有帮助，需要这份全套学习资料的朋友可以戳我获取！！

由于文件比较大，这里只是将部分目录截图出来，每个节点里面都包含大厂面经、学习笔记、源码讲义、实战项目、讲解视频，并且会持续更新！
id开发知识点！不论你是刚入门Android开发的新手，还是希望在技术上不断提升的资深开发者，这些资料都将为你打开新的学习之门**

如果你觉得这些内容对你有帮助，需要这份全套学习资料的朋友可以戳我获取！！

由于文件比较大，这里只是将部分目录截图出来，每个节点里面都包含大厂面经、学习笔记、源码讲义、实战项目、讲解视频，并且会持续更新！