#include <bits/stdc++.h>
using namespace std;
bool cmp(pair<int, int> a, pair<int, int> b) {
  if (a.first == b.first) return a.second < b.second;
  return a.first < b.first;
}
void showvi(vector<int> v) {
  for (int i = 0; i < v.size(); i++) cout << v[i] << " ";
  cout << endl;
}
void showvl(vector<long long> v) {
  for (int i = 0; i < v.size(); i++) cout << v[i] << " ";
  cout << endl;
}
void showvp(vector<pair<int, int> > v) {
  for (int i = 0; i < v.size(); i++)
    cout << v[i].first << " " << v[i].second << endl;
}
long long fastpower(long long a, long long n) {
  long long ans = 1;
  while (n > 0) {
    if (n & 1) ans = (ans * a);
    a = (a * a);
    n = n >> 1;
  }
  return ans;
}
void SOE() {
  int prime[100001];
  for (int i = 1; i <= 100000; i++) prime[i] = i;
  for (int p = 2; p * p <= 100000; p++) {
    if (prime[p] == p) {
      for (int i = p * p; i <= 100000; i += p) {
        if (prime[i] == i) prime[i] = p;
      }
    }
  }
}
void factor(int n) {
  if (n == 1) return;
  for (int i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      while (n % i == 0) {
        n = n / i;
      }
    }
  }
}
long long dp[200009][2];
vector<int> v;
int n;
long long cal(int pos, int sgn, int x) {
  if (x <= 0 || x > n) {
    return 0;
  }
  if (dp[x][sgn] == -2) return -2;
  int z = x;
  if (dp[z][sgn] != -1) return dp[z][sgn];
  dp[x][sgn] = -2;
  long long y = 0;
  if (x == 1) {
    if (sgn == 1)
      x -= pos;
    else
      x += pos;
    long long z2 = cal(pos, 1 ^ sgn, x);
    if (z2 == -2) {
      return dp[z][sgn] = -2;
    }
    y = pos + z2;
  } else {
    if (sgn == 0)
      x += v[z - 2];
    else
      x -= v[z - 2];
    long long z2 = cal(pos, 1 ^ sgn, x);
    if (z2 == -2) return dp[z][sgn] = -2;
    y = v[z - 2] + z2;
  }
  return dp[z][sgn] = y;
}
void solve() {
  cin >> n;
  v.clear();
  for (int i = 0; i < n - 1; i++) {
    int x;
    cin >> x;
    v.push_back(x);
  }
  for (int i = 0; i < 200009; i++) {
    dp[i][0] = -1;
    dp[i][1] = -1;
  }
  dp[1][0] = -2;
  for (int i = 1; i < n; i++) {
    long long zz = cal(i, 1, i + 1);
    if (zz == -2)
      cout << "-1" << endl;
    else
      cout << i + zz << endl;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t = 1;
  for (int i = 0; i < t; i++) {
    solve();
  }
  return 0;
}
