#include <bits/stdc++.h>
using namespace std;
const int N = 1e6;
const int INF = 0x3f3f3f3f;
const double eps = 0.0000001;
const long long mod = 1e9 + 7;
long long mul(long long a, long long b) { return (a % mod * b % mod) % mod; }
long long pre(long long a, long long b) { return (a % mod / b % mod) % mod; }
long long n, m, k, x, y, z;
int a[N];
int vis[N];
vector<int> p;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    if (a[i] == 0)
      vis[i] = -1, p.push_back(i);
    else
      vis[i] = INF;
  }
  for (int i = 0; i < p.size(); i++) {
    for (int j = p[i] - 1; j >= 1; j--) {
      if (vis[j] == -1)
        break;
      else {
        vis[j] = min(vis[j], p[i] - j);
        if (vis[j] != p[i] - j) break;
      }
    }
    for (int j = p[i] + 1; j <= n; j++) {
      if (vis[j] == -1)
        break;
      else {
        vis[j] = min(vis[j], j - p[i]);
        if (vis[j] != j - p[i]) break;
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    if (vis[i] == -1)
      cout << 0 << " ";
    else
      cout << vis[i] << " ";
  }
}
