#include <bits/stdc++.h>
using namespace std;
long long n, a[200001], dp[200001][2];
bool vis[200001][2];
long long solve(long long x, long long f) {
  if (x <= 0 || x > n) return 0;
  if (vis[x][f] == true) return dp[x][f];
  vis[x][f] = true;
  if (f == 0) {
    long long z = solve(x + a[x], 1 - f);
    if (z == -1)
      dp[x][f] = -1;
    else
      dp[x][f] = a[x] + z;
  } else {
    long long z = solve(x - a[x], 1 - f);
    if (z == -1)
      dp[x][f] = -1;
    else
      dp[x][f] = a[x] + z;
  }
  return dp[x][f];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long i;
  cin >> n;
  for (i = 2; i <= n; i++) {
    cin >> a[i];
  }
  memset(dp, -1, sizeof(dp));
  memset(vis, false, sizeof(vis));
  vis[1][0] = true;
  vis[1][1] = true;
  for (i = 2; i <= n; i++) {
    if (!vis[i][0]) solve(i, 0);
    if (!vis[i][1]) solve(i, 1);
  }
  for (i = 1; i <= n - 1; i++) {
    if (dp[i + 1][1] == -1)
      cout << "-1" << endl;
    else
      cout << i + dp[i + 1][1] << endl;
  }
  return 0;
}
