Codeforces 283. B. Cow Program记忆化搜索

output

standard output

Farmer John has just given the cows a program to play with! The program contains two integer variables, x and y, and performs the following operations on a sequence a1, a2, ..., an of positive integers:

1. Initially, x = 1 and y = 0. If, after any step, x ≤ 0 or x > n, the program immediately terminates.
2. The program increases both x and y by a value equal to ax simultaneously.
3. The program now increases y by ax while decreasing x by ax.
4. The program executes steps 2 and 3 (first step 2, then step 3) repeatedly until it terminates (it may never terminate). So, the sequence of executed steps may start with: step 2, step 3, step 2, step 3, step 2 and so on.

The cows are not very good at arithmetic though, and they want to see how the program works. Please help them!

You are given the sequence a2, a3, ..., an. Suppose for each i (1 ≤ i ≤ n - 1) we run the program on the sequence i, a2, a3, ..., an. For each such run output the final value of y if the program terminates or -1 if it does not terminate.

Input

The first line contains a single integer, n (2 ≤ n ≤ 2·105). The next line contains n - 1 space separated integers, a2, a3, ..., an(1 ≤ ai ≤ 109).

Output

Output n - 1 lines. On the i-th line, print the requested value when the program is run on the sequence i, a2, a3, ...an.

Please do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64dspecifier.

Examples

input

Copy

4
2 4 1

output

Copy

3
6
8

input

Copy

3
1 2

output

Copy

-1
-1

Note

In the first sample

1. For i = 1,  x becomes  and y becomes 1 + 2 = 3.
2. For i = 2,  x becomes  and y becomes 2 + 4 = 6.
3. For i = 3,  x becomes  and y becomes 3 + 1 + 4 = 8.

 一开始想到的就是那个map记录一下当前这个x是否出现过如果出现过那就说明会死循环然后每次都需要初始化最后超时了，后来看到题解这个状态不仅是当前x值出现的次数而且还有当前状态是操作2还是操作3这样就能一个状态数组记录下来最后直接O(n)输出，通过暴力的代码提取出状态最后记忆化搜索，666。

#include <iostream>
#include <cstdio>
#include <set>
#include <map>
#include <algorithm>
#include <string.h>
#include <vector>
#include <queue>
#include <stack>
using namespace std;
bool vis[200009][2];
int n;
long long dp[200009][2];
int a[200009];
void dfs(int x,bool j){
    if(vis[x][j])
        return ;
    vis[x][j]=1;
    int y=j?(x+a[x]):(x-a[x]);
    if(y<=0||y>n)dp[x][j]=a[x];
    else
    {
        dfs(y,j^1);
        if(dp[y][j^1]!=-1){
            dp[x][j]=dp[y][j^1]+a[x];
        }
    }
}
int main(){

    while(cin>>n){
        memset(dp,-1,sizeof(dp));
        memset(vis,false,sizeof(vis));
        for(int i=2;i<=n;i++){
            scanf("%d",&a[i]);
        }
        for(int i=2;i<=n;i++)
        {
            dfs(i,0);
        }
        for(int i=2;i<=n;i++)
        {
            if(dp[i][0]!=-1){
                dp[i][0]+=i-1;
            }
            cout<<dp[i][0]<<endl;
        }
    }
}