There is a house with nn flats situated on the main street of Berlatov. Vova is watching this house every night. The house can be represented as an array of nn integer numbers a1,a2,…,ana1,a2,…,an, where ai=1ai=1 if in the ii-th flat the light is on and ai=0ai=0 otherwise.

Vova thinks that people in the ii-th flats are disturbed and cannot sleep if and only if 1<i<n1<i<n and ai?1=ai+1=1ai?1=ai+1=1 and ai=0ai=0.

Vova is concerned by the following question: what is the minimum number kk such that if people from exactly kk pairwise distinct flats will turn off the lights then nobody will be disturbed? Your task is to find this number kk.

Input
The first line of the input contains one integer nn (3≤n≤1003≤n≤100) — the number of flats in the house.

The second line of the input contains nn integers a1,a2,…,ana1,a2,…,an (ai∈{0,1}ai∈{0,1}), where aiai is the state of light in the ii-th flat.

Output
Print only one integer — the minimum number kk such that if people from exactly kk pairwise distinct flats will turn off the light then nobody will be disturbed.

Examples
Input
10
1 1 0 1 1 0 1 0 1 0
Output
2
Input
5
1 1 0 0 0
Output
0
Input
4
1 1 1 1
Output
0
Note
In the first example people from flats 22 and 77 or 44 and 77 can turn off the light and nobody will be disturbed. It can be shown that there is no better answer in this example.

There are no disturbed people in second and third examples.

這個題目，其實遍歷一遍就好了，如果出現了101這種情況，就把右邊的燈關了，然后就這樣
代碼如下：

#include<iostream> #include<cstdio> #include<cmath> #include<cstring> using namespace std;const int maxx=101; int a[maxx]; int n;int main() {while(scanf("%d",&n)!=EOF){memset(a,0,sizeof(a));for(int i=0;i<n;i++){scanf("%d",&a[i]);}int sum=0;for(int i=0;i<n;i++){if(i&&i!=n-1){if(a[i]==0&&a[i-1]==1&&a[i+1]==1){a[i+1]=0;sum++;}}}printf("%d\n",sum);}}

努力加油a啊，(^o)/~

總結

以上是生活随笔為你收集整理的Disturbed People（思维）的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。