#include<bits/stdc++.h>
using namespace std;
#define sf(x) scanf("%lld",&x)
#define sff(x,y) scanf("%lld%lld",&x,&y)
#define endl '\n'
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define pf(x) printf("%lld",x)
#define pii pair<int,int> 
#define f first 
#define s second
#define int long long



//
//
const int N = 1e6+10;
int h[N],e[N],ne[N],idx,du[N];
void add(int a,int b)
{
	ne[idx]=h[a],e[idx]=b,h[a]=idx++;
}

bool dfs(int u,int fa,int d)
{
	int sum=0;
	if(du[u]==2&&u!=1) return 0;
	for(int i=h[u];~i;i=ne[i])
	{
		int j=e[i];
		if(j==fa) continue;
		if(dfs(j,u,d+1)) sum++;
	}
	if(sum>=2||!sum) return 1;
	return 0;
}
//



void solve()
{
	int m,n;
	cin>>m;
	n=m-1;
	for(int i=1;i<=m;i++) h[i]=-1;
	while(n--)
	{
		int a,b;
		cin>>a>>b;
		add(a,b);
		add(b,a);
		du[a]++,du[b]++;
	}

	if(dfs(1,-1,0)&&du[1]>=2)cout<<"You win, temporarily."<<endl;
	else cout<<"Wasted."<<endl;
}
signed main()
{
	IOS;
	int _=1;
	while(_--)
		solve();
	return 0;
}