#include <bits/stdc++.h>
using namespace std;
vector<long long int> a, ans, d;
vector<vector<long long int> > g;
long long int n;
void bfs(long long int s) {
  queue<int> q;
  q.push(s);
  vector<bool> used(n + 2);
  used[s] = true;
  while (!q.empty()) {
    int v = q.front();
    q.pop();
    for (size_t i = 0; i < g[v].size(); ++i) {
      long long int to = g[v][i];
      if (!used[to]) {
        used[to] = true;
        q.push(to);
        d[to] = d[v] + 1;
      }
    }
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  a.resize(n + 2);
  ans.resize(n + 2);
  d.resize(n + 2);
  g.resize(n + 2);
  for (int i = 2; i <= n + 1; ++i) {
    cin >> a[i];
    g[a[i] % 2].push_back(i);
    if (a[i] + i < n + 2) g[a[i] + i].push_back(i);
    if (i - a[i] > 1) g[i - a[i]].push_back(i);
  }
  bfs(0);
  for (int i = 0; i < g[1].size(); ++i) ans[g[1][i]] = d[g[1][i]] - 1;
  d.assign(n + 2, 0);
  bfs(1);
  for (int i = 0; i < g[0].size(); ++i) ans[g[0][i]] = d[g[0][i]] - 1;
  for (int i = 2; i <= n + 1; ++i) cout << max(ans[i], -1ll) << " ";
}
