Codeforces 803 B - Distances to Zero

You are given the array of integer numbers a₀, a₁, ..., a_n - 1. For each element find the distance to the nearest zero (to the element which equals to zero). There is at least one zero element in the given array.

Input

The first line contains integer n (1 ≤ n ≤ 2·10⁵) — length of the arraya. The second line contains integer elements of the array separated by single spaces ( - 10⁹ ≤ a_i ≤ 10⁹).

Output

Print the sequence d₀, d₁, ..., d_n - 1, whered_i is the difference of indices betweeni and nearest j such thata_j = 0. It is possible thati = j.

Example

Input

9
2 1 0 3 0 0 3 2 4

Output

2 1 0 1 0 0 1 2 3 

Input

5
0 1 2 3 4

Output

0 1 2 3 4 

Input

7
5 6 0 1 -2 3 4

Output

2 1 0 1 2 3 4 

就是输出每个数字与离它最近的0的距离

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int zero[200000];
int main(){
	memset(zero,0,4);
	int n;
	cin>>n;
	int m;
	int count=0;
	for(int i=0;i<n;i++){
		cin>>m;
		if(m==0) zero[count++]=i;
	}
	int a=0;
	int flag=0;
	for(int i=0;i<n;i++){
		flag=abs(i-zero[a]);
		if(a>0){
			if(flag>0){
				flag=min(flag,abs(i-zero[a-1]));
			}
		}
		if(flag==0) a++;
		if(i!=0) cout<<" "<<flag;
		else cout<<flag;
	}
}