#include<bits/stdc++.h>
using namespace std;
#define int long long
using PII = pair<int, int>;
using PIII = tuple<int, int, int>;
const int MOD = 1e9 + 7;
struct cmp {  //priority_queue
	bool operator()(const PIII& a, const PIII& b) {
		return std::get<0>(a) < std::get<0>(b); //down
	}
};

bool cmpsort(const PII& a, const PII& b) {  //sort
	return a.first < b.first; //up
}

int flag[100010] = { 0 };
vector <int> mp[100010];
void dfs(int now,int pre) {
	int f = 0;
	int s = 0;
	for (auto it : mp[now]) {
		if (it == pre) {
			continue;
		}
		else {
			f = 1;
			dfs(it, now);
			if (flag[it] == 1) {
				s++;
			}
		}
	}
	if (f == 0) {
		flag[now] = 1;
	}
	if (s >= 2) {
		flag[now] = 1;
	}
}
void solve() {
	int n;
	cin >> n;
	for (int i = 0; i < n-1; i++) {
		int a, b;
		cin >> a >> b;
		mp[a].push_back(b);
		mp[b].push_back(a);
	}
	dfs(1,-1);
	if (mp[1].size() == 1 || flag[1] == 1) {
		cout << "You win, temporarily.";
	}
	else {
		cout << "Wasted.";
	}
}
signed main() {
	ios::sync_with_stdio(0), cin.tie(0); cout.tie(0);
	//cout << fixed << setprecision(12);
	int t;
	t = 1;
	while (t--) {
		solve();
	}
}