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 ≤ 106) — 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 ai, it is hanging on (and 0, if is there is no such lamp), and its temperature ti ( - 100 ≤ ti ≤ 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.

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:

这次cf奇难无比。

题意大概就是给一棵树，每个点有点权，然后问说能不能把边切掉两条，分成3部分，然后每部分的点权和都相等。

一遍dfs有某个子树的权值和为sum/3就删掉这棵子树，然后再原模原样做一遍。

注意！！！！！！！！

如果第一次有多棵树，一定要删掉点数小的那棵树！避免第二次没有树可以删了

#include<cmath>
#include<algorithm>
#include<cstring>
#include<string>
#include<set>
#include<map>
#include<time.h>
#include<cstdio>
#include<vector>
#include<stack>
#include<queue>
#include<iostream>
using namespace std;
#define  LONG long long
const int   INF=0x3f3f3f3f;
const LONG  MOD=1e9+7;
const double PI=acos(-1.0);
#define clrI(x) memset(x,-1,sizeof(x))
#define clr0(x) memset(x,0,sizeof x)
#define clr1(x) memset(x,INF,sizeof x)
#define clr2(x) memset(x,-INF,sizeof x)
#define EPS 1e-10
struct Edge
{
    int to ,next,id;
}edge[2000100];
int tar ;
int head[2000100];
int dp[1000100];
int si[1000100];
bool vis[1000100];
int val[1000100];
int tot = 0;
bool note[1001000];
int Pre[1000100];
void Init()
{
    clr0(note);
    clr0(si);
    tot = 0;
    clrI(head);
    clr0(dp);
    memset(vis , false , sizeof (vis)) ;
    clr0(Pre);
}
void add_edge(int u , int v, int p )
{
    edge[++tot].to = v;
    edge[tot].next = head[u];
    head[u] = tot ;
    edge[tot].id = p ;
}
void dfs1(int u , int pre)
{
    si[u] += 1;
    dp[u] += val[u];
    Pre[u] = pre ;
    for(int i = head[u] ; i != -1 ; i = edge[i].next)
    {
        int v = edge[i].to ;
        if ( v == pre)continue ;
        if(!vis[v])
        {
            dfs1(v , u);
            dp[u] += dp[v];
            si[u] += si[v];
        }
    }
}
void dfs2(int u , int pre)
{
    vis[u] = 1;
    for(int i = head[u] ; i != -1 ; i = edge[i].next)
    {
        int v = edge[i].to ;
        if(v == pre )continue ;
        dfs2(v , u);
    }
}
int main()
{
    Init();
    int n ;
    int ans1 = 0 , ans2 = 0;
    cin>>n;
    int sum = 0;
    int rt;
    for(int i = 1; i <= n ;++ i)
    {
        int u , v;
        scanf("%d%d",&v,&val[i]);
        note[v]++;
        note[i]++ ;
        if(v != 0 )
        {
            add_edge(i , v , i);
            if(ans1 == 0)ans1 = i;
            else if(ans2 == 0)ans2 = i;
            add_edge(v,i,i);
        }
        if(v == 0)
            rt = i;
        sum += val[i];
    }
    if( sum %3 !=0 || tot/2  != n-1)
    {
        cout<<-1<<endl;
        return 0;
    }
    tar = sum /3 ;
    dfs1( rt , -1 );
    int re = 0;
    int minx = 199999999;
    bool judge1 = 0 , judge2 = 0;
    for(int i = 1; i<= n ;++ i)
        if(dp[i ] == tar)
            if(minx > si[i])
            {
                re = i;
                minx = si[i];
            }
    dfs2(re , Pre[re]);
    for(int j = head[re] ; j!= -1 ; j =edge[j].next)
        if(edge[j].to == Pre[re])
        {
            judge1 = 1;
            ans1 = edge[j].id ;
            break ;
        }
    clr0(dp);
    rt = -1;
    for(int i = 1; i<=n ;++ i)
        if(!vis[i])
        {
            rt = i;
            break ;
        }
    if(rt== -1)
    {
        cout<<-1<<endl;
        return 0;
    }
    //cout<<rt<<endl;
    dfs1(rt,-1);
     for(int i =1 ;i<=n ;++i )
     {
        if(vis[i])continue ;
        if(dp[i] == tar)
        {
        for(int j = head[i]; j != -1 ; j = edge[j].next)
            if(edge[j].to == Pre[i])
            {
                judge2 = 1;
                ans2 = edge[j].id ;
                break;
            }
        }
     }
    // printf("%d %d ",judge1,judge2);
     if(judge1 && judge2)
         printf("%d %d\n",min(ans1,ans2),max(ans1,ans2));
     else
         cout<<-1<<endl;
}