#include <bits/stdc++.h>
#pragma GCC optimize("O2,unroll-loops")
#pragma GCC target("tune=native")
using namespace std;
using ll = long long;
using ld = long double;
template <class T>
using vec = vector<T>;
template <class T>
using v2d = vector<vector<T>>;
template <class T>
using prq = priority_queue<T>;
template <class T>
using rpq = priority_queue<T, vector<T>, greater<T>>;
struct Data {
  int p, c, x;
};
int main() {
  int n;
  scanf("%d", &n);
  vec<bool> x(n);
  v2d<int> gr(n);
  for (int i = 0; i < n; ++i) {
    int a;
    scanf("%d", &a);
    if (i - a >= 0) gr[i - a].push_back(i);
    if (i + a < n) gr[i + a].push_back(i);
    x[i] = a & 1;
  }
  queue<Data> bfs;
  for (int i = 0; i < n; ++i) bfs.push({i, 0, x[i]});
  const int inf = 1e9;
  v2d<int> res(n, vec<int>(2, inf));
  while (!bfs.empty()) {
    int a = bfs.front().p, b = bfs.front().c, c = bfs.front().x;
    bfs.pop();
    for (auto &i : gr[a])
      if (b + 1 < res[i][c]) {
        res[i][c] = b + 1;
        bfs.push({i, b + 1, c});
      }
  }
  for (int i = 0; i < n; ++i) {
    if (res[i][x[i] ^ 1] < inf)
      printf("%d", res[i][x[i] ^ 1]);
    else
      printf("-1");
    if (i < n - 1) putchar(' ');
  }
  putchar('\n');
}
