#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
long long memo[N][2];
int a[N], n, vis[N][2];
long long dfs(long long x, int state) {
  if (x <= 0 || x > n) return 0;
  if (x == 1 || vis[x][state] == 1) return -1;
  if (vis[x][state] == 2) return memo[x][state];
  vis[x][state] = 1;
  long long val = dfs(x + (state == 0 ? a[x] : -a[x]), state ^ 1);
  vis[x][state] = 2;
  if (val == -1) return memo[x][state] = -1;
  return memo[x][state] = a[x] + val;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 2; i <= n; i++) cin >> a[i];
  for (int i = 1; i < n; i++) {
    long long val = dfs(i + 1, 1);
    if (val == -1)
      cout << "-1\n";
    else
      cout << (val + i) << "\n";
  }
  return 0;
}
