#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 7;
const int inf = 1e9;
int a[maxn];
long long dp[maxn][2];
vector<int> adj[maxn];
bool vis[maxn];
int n;
void bfs(int type) {
  queue<int> q;
  for (int i = 1; i <= n; i++)
    if ((a[i] & 1) != type) {
      dp[i][type] = 0;
      q.push(i);
    }
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    for (auto v : adj[u])
      if (dp[v][type] > dp[u][type] + 1) {
        dp[v][type] = dp[u][type] + 1;
        q.push(v);
      }
  }
}
int main() {
  ios ::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    int x = i + a[i];
    if (x <= n) adj[x].push_back(i);
    x = i - a[i];
    if (x >= 1) adj[x].push_back(i);
  }
  for (int i = 1; i <= n; i++) dp[i][0] = dp[i][1] = inf;
  bfs(0);
  bfs(1);
  for (int i = 1; i <= n; i++) {
    int type = a[i] & 1;
    if (dp[i][type] < inf)
      cout << dp[i][type] << " ";
    else
      cout << -1 << " ";
  }
  cout << endl;
  return 0;
}
