Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

B. Distances to Zero

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou are given the array of integer numbers *a*_{0}, *a*_{1}, ..., *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^{5}) — length of the array *a*. The second line contains integer elements of the array separated by single spaces ( - 10^{9} ≤ *a*_{i} ≤ 10^{9}).

Output

Print the sequence *d*_{0}, *d*_{1}, ..., *d*_{n - 1}, where *d*_{i} is the difference of indices between *i* and nearest *j* such that *a*_{j} = 0. It is possible that *i* = *j*.

Examples

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

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/22/2019 16:14:06 (d1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|