#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MAX (int)2e5+100
vector<int> e[MAX];
int n;

int dfs(int now, int fa)
{
	int cnt = 0;
	int tot = 0;
	for (auto it = e[now].begin(); it != e[now].end(); it++) {
		if (*it == fa)
			continue;
		cnt += dfs(*it, now);
		tot++;
	}
	if (tot == 0)
		return 1;
	if (cnt >= 2)
		return 1;
	//printf("%d\n", now);
	return 0;
}

int main()
{
	int i, j, k;
	cin >> n;
	for (i = 1; i < n; i++) {
		int u, v;
		cin >> u >> v;
		e[u].push_back(v);
		e[v].push_back(u);
	}
	int res = dfs(1, 0);
	if (!res)
		printf("Wasted.\n");
	else {
		printf("You win, temporarily.\n");
	}
	return 0;
}