H - Garland (dp)

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 (and 0, if is there is no such lamp), and its temperature t_i ( - 100 ≤ t_i ≤ 100). The lamps are numbered from 1 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.

Example

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

 思路: 1.如果总温度之和不能被3整除,则输出-1.

     2.对于温度dp,每个节点i dp[i]表示以该节点为根节点子树温度总和,具体方法就是用一个数组记录被刮次数

      对于最后被挂次数为零的为叶结点,将所有叶结点装入队列,依次往上dp ,一旦有某子树dp到sum / 3 则把它去掉,注意

      此时该节点的父节点不能再dp 被去掉的值, 

      如: 样例: 3   2 1  3 1  0 1  另外树根也不能入队列, 如   3    2 0   0 6   2 -6 

#include <cstdio>
#include <queue>
#include <map>
#include <stack>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
const int maxn = 1e6+10;
int up[maxn]; //记录节点挂在谁身上
int dp[maxn]; //dp 温度
int ans[maxn];
int num[maxn]; //记录被挂次数
queue <int> q;
int main()
{
    int n;
    int sum = 0;
    scanf("%d",&n);
    for(int i = 1; i<=n; i++)
    {
        int x,y;
        scanf("%d%d",&x,&y);
        up[i] = x;
        dp[i] = y;
        sum+=y ;
        num[x]++;
    }
    if(sum%3)
    {
        printf("-1\n");
        return 0;
    }
    for(int i = 1; i <= n; i++)
        if(num[i] == 0) q.push(i);
    int k = 0;
    while(q.size())
    {
        int x = q.front();
        int y = up[x];
        q.pop();
        num[y]--;
        if(num[y]==0 && up[y]) //不要根节点
            q.push(y);
        if(dp[x] == sum/3)
            ans[k++] = x;
        else
            dp[y] += dp[x];// 如果子树被去掉父亲节点不再dp他的值。
    }
    if(k >= 2)  printf("%d %d\n",ans[1],ans[0]);
    else  printf("-1\n");
    return 0;
}