Codeforces Round #398 (Div. 2) C. Garland

C. Garland

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Once at New Year Dima had a dream in which he was presented a fairy garland. A garland is a set of lamps, some pairs of which are connected by wires. Dima remembered that each two lamps in the garland were connected directly or indirectly via some wires. Furthermore, the number of wires was exactly one less than the number of lamps.

There was something unusual about the garland. Each lamp had its own brightness which depended on the temperature of the lamp. Temperatures could be positive, negative or zero. Dima has two friends, so he decided to share the garland with them. He wants to cut two different wires so that the garland breaks up into three parts. Each part of the garland should shine equally, i. e. the sums of lamps' temperatures should be equal in each of the parts. Of course, each of the parts should be non-empty, i. e. each part should contain at least one lamp.

Help Dima to find a suitable way to cut the garland, or determine that this is impossible.

While examining the garland, Dima lifted it up holding by one of the lamps. Thus, each of the lamps, except the one he is holding by, is now hanging on some wire. So, you should print two lamp ids as the answer which denote that Dima should cut the wires these lamps are hanging on. Of course, the lamp Dima is holding the garland by can't be included in the answer.

Input

The first line contains single integer n (3 ≤ n ≤ 10⁶) — the number of lamps in the garland.

Then n lines follow. The i-th of them contain the information about the i-th lamp: the number lamp a_i, it is hanging on (and0, if is there is no such lamp), and its temperaturet_i ( - 100 ≤ t_i ≤ 100). The lamps are numbered from1 to n.

Output

If there is no solution, print -1.

Otherwise print two integers — the indexes of the lamps which mean Dima should cut the wires they are hanging on. If there are multiple answers, print any of them.

Examples

Input

6
2 4
0 5
4 2
2 1
1 1
4 2

Output

1 4

Input

6
2 4
0 6
4 2
2 1
1 1
4 2

Output

-1

Note

The garland and cuts scheme for the first example:

题意没什么好说的，就是给你棵树让你去掉两条边分成三份使得每份的和相同。

很坑，从根开始DFS算出每个节点以其根的子树的加和，其中先考虑ti全部是0的情况，其次是三部分加起来为0的情况（数据 4 0 0 1 -5 2 5 1 0），最后是还有一种特殊情况（没想到应该都挂在第9组数据），就是一个点加和与它其中一个子树的加和相同，但是总加和的1/3不为0（不理解的可以试一下这组数据 5 0 3 1 1 1 0 2 2 3 3，自己画一下）

下面是代码

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 1e6 + 7;
int head[maxn], to[maxn<<1], nex[maxn<<1], cnt = 1, k; // k表示所有节点权值加和的1/3
int s[maxn];
int vis[maxn];

void add(int u, int v){
    to[cnt] = v;
    nex[cnt] = head[u];
    head[u] = cnt ++;
}

int DFS(int st, int fa){
    int tt = 0; // tt 表示这个节点与及它的所有子树一共可以tt份成加和为k的部分
    for(int i = head[st]; i; i = nex[i]){
        if(to[i] == fa) continue;
        tt += DFS(to[i], st);
        s[st] += s[to[i]];
    }
    if(s[st] == k*(tt+1)) vis[st] = ++ tt;
    return tt;
}


int main(){
    int n, x, y, sum = 0, record;
    scanf("%d", &n);
    for(int i = 1; i <= n; i ++){
        scanf("%d %d", &x, &y);
        s[i] = y;
        sum += y;
        if(x == 0) record = i;
        else add(i, x), add(x, i);
    }
    if(sum%3 != 0) printf("-1\n");
    else{
        k = sum/3;
        int ans = DFS(record, -1);
        if(ans < 3){
            printf("-1\n");
            return 0;
        }
        for(int i = 1, j = 2; i <= n; i ++){
            if(vis[i] == 1 || vis[i] == 2){
                printf("%d", i);
                j --;
                if(j) printf(" ");
                else break;
            }
        }
        printf("\n");
    }
    return 0;
}