#include <bits/stdc++.h>
using namespace std;
int vis[200001][2];
long long ar[200001];
long long sum[200001][2];
int n;
long long dfs(int p, int v) {
  if (p <= 0 || p > n) return 0;
  if (p == 1) return -1;
  if (vis[p][v] != 0) return sum[p][v];
  vis[p][v] = 1;
  sum[p][v] = -1;
  if (v == 0) {
    long long r = dfs(p - ar[p], 1 - v);
    if (r == -1)
      return sum[p][v] = -1;
    else
      return sum[p][v] = ar[p] + r;
  } else {
    long long r = dfs(p + ar[p], 1 - v);
    if (r == -1)
      return sum[p][v] = -1;
    else
      return sum[p][v] = ar[p] + r;
  }
}
int main() {
  long long a, b, c, d = 0, e, f, g, h, i, y, z;
  cin >> n;
  for (i = 2; i <= n; i++) {
    cin >> ar[i];
  }
  for (i = 2; i <= n; i++) {
    dfs(i, 0);
    dfs(i, 1);
  }
  for (i = 1; i < n; i++) {
    if (sum[1 + i][0] == -1)
      cout << -1 << endl;
    else
      cout << i + sum[1 + i][0] << endl;
  }
}
