#include<bits/stdc++.h>
#define MAX 1000000006
using namespace std;
typedef long long ll;
ll as[100005]={0,0},ag[100005]={0},ak[100005]={0};
queue<ll>s;
int main()
{
	ll n,i,a,b;
	cin>>n;
	for(i=1;i<=n-1;i++)
	{
		cin>>a>>b;
		if(a>b)
		{
			as[a]=b;
		}
		else
		{
			as[b]=a;
		}
	}
	for(i=n;i>1;i--)
	{
		if(ag[i]==0)
		{
			ag[as[i]]++;
		}
		ak[as[i]]++;
	}
	ll f=1;
	for(i=n-1;i>=1;i--)
	{
		if(ag[i]>=2)
		{
			s.push(i);
		}
		if(ak[i]!=1)
		{
			f=0;
		}
	}
	while(s.size())
	{
		ag[as[s.front()]]++;
		if(ag[as[s.front()]]==2&&as[s.front()]!=1)
		{
			s.push(as[s.front()]);
		}
		s.pop();
	}
	if((f&&n!=1)||ag[1]>=2)
	{
		cout<<"You win, temporarily.\n";
	}
	else
	{
		cout<<"Wasted.\n";
	}
}