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

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，根节点不能被剪

用vector容器存储树，如果权值之和tot不能被3整除，直接输出-1

用sum数组存储所有节点的子树权值之和，具体方法深搜，如果有一个结点i的sum[i]为tot/3，则记录这个点，

并使sum[i]=0，找到两个这样的点即可

#include<stdio.h>
#include<vector>
#include<string.h>
using namespace std;
const int maxn=1000070;
vector<int> mp[maxn];
int f[maxn];
int val[maxn];
int sum[maxn];
int tot,ok;
int ans1,ans2;
void dfs(int u,int from)
{
	sum[u]=val[u];
	for(int i=0;i<mp[u].size();i++)
	{
		int v=mp[u][i];
		if(v==from) continue;
		dfs(v,u);
		sum[u]+=sum[v];
	}
	if(sum[u]==tot)
	{
		if(from==-1) return;
		if(ans1==-1)
		{
			ans1=u;
			sum[u]=0;
		}
		else if(ans2==-1)
		{
			ans2=u;
			sum[u]=0;
		}
	}
}
int main(void)
{
	int n;
	while(scanf("%d",&n)!=EOF)
	{
		for(int i=0;i<=n;i++) mp[i].clear();
		int root;
		tot=0;
		for(int i=1;i<=n;i++)
		{
			scanf("%d%d",&f[i],&val[i]);
			tot+=val[i];
			if(f[i]==0)
			{
				root=i;
				continue;
			}
			mp[i].push_back(f[i]);
			mp[f[i]].push_back(i);
		}
		if(tot%3!=0){
			printf("-1\n");
			continue;
		}
		ans1=-1;
		ans2=-1;
		tot/=3;
		ok=0;
		dfs(root,-1);
		if(ans1==-1||ans2==-1) printf("-1\n");
		else printf("%d %d\n",ans1,ans2);	
	}
}