#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (int &x : a) cin >> x;
  vector<int> adj[n];
  vector<int> ans(n, -1);
  auto ok = [&](int i, int j) -> bool { return (a[i] + a[j]) & 1; };
  for (ll i(0), _a(n); i < _a; ++i) {
    if (a[i] + i < n) {
      adj[a[i] + i].push_back(i);
      if (ok(i, a[i] + i)) ans[i] = 1;
    }
    if (i - a[i] >= 0) {
      adj[i - a[i]].push_back(i);
      if (ok(i, i - a[i])) ans[i] = 1;
    }
  }
  queue<int> q;
  for (ll i(0), _a(n); i < _a; ++i)
    if (ans[i] == 1) q.push(i);
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    for (int v : adj[u]) {
      if (ans[v] == -1 && !ok(u, v)) {
        ans[v] = ans[u] + 1;
        q.push(v);
      }
    }
  }
  for (int x : ans) cout << x << " ";
  cout << "\n";
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int T = 1;
  for (ll i(1), _b(T); i <= _b; ++i) {
    solve();
  }
}
