#include <bits/stdc++.h>
inline int two(int n) { return 1 << n; }
inline int test(int n, int b) { return (n >> b) & 1; }
inline void set_bit(int& n, int b) { n |= two(b); }
inline void unset_bit(int& n, int b) { n &= ~two(b); }
inline int last_bit(int n) { return n & (-n); }
inline int ones(int n) {
  int res = 0;
  while (n && ++res) n -= n & (-n);
  return res;
}
long long int gcd(long long int a, long long int b) {
  return (a ? gcd(b % a, a) : b);
}
long long int modPow(long long int a, long long int b, long long int MOD) {
  long long int x = 1, y = a;
  while (b > 0) {
    if (b % 2 == 1) {
      x = (x * y) % MOD;
    }
    b /= 2;
    y = (y * y) % MOD;
  }
  return x;
}
long long int modInverse(long long int a, long long int p) {
  return modPow(a, p - 2, p);
}
using namespace std;
const int N = 2e5 + 5;
int dp1[N];
int dp2[N];
int arr[N];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int i, j, firstzero, lastzero, f1, f2, n;
  int ctr;
  cin >> n;
  f1 = f2 = 0;
  for (int i = 0; i < (n); i++) {
    cin >> arr[i];
    if (f1 == 0 && arr[i] == 0) {
      firstzero = i;
      f1++;
    }
    if (arr[i] == 0) lastzero = i;
  }
  ctr = 0;
  for (i = firstzero; i < n; i++) {
    if (arr[i] == 0) {
      dp1[i] = 0;
      ctr = 1;
    } else
      dp1[i] = ctr++;
  }
  ctr = 1;
  for (i = firstzero - 1; i >= 0; i--) {
    if (arr[i] == 0) {
      dp1[i] = 0;
      ctr = 1;
    } else
      dp1[i] = ctr++;
  }
  ctr = 1;
  for (i = lastzero; i < n; i++) {
    if (arr[i] == 0) {
      dp2[i] = 0;
      ctr = 1;
    } else
      dp2[i] = ctr++;
  }
  ctr = 1;
  for (i = lastzero - 1; i >= 0; i--) {
    if (arr[i] == 0) {
      dp2[i] = 0;
      ctr = 1;
    } else
      dp2[i] = ctr++;
  }
  for (int i = 0; i < (n); i++) cout << min(dp1[i], dp2[i]) << " ";
  return 0;
}
