/*
ANALYSIS:

*/
#include <iostream>
#include <cstring>
#include <string>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <stack>
#include <ctime>
#include <random>
#define int long long
#define endl '\n'
using namespace std;
const int N=1e5+5;
vector<int>edge[N];
int n,ans[N];

void dfs(int u,int fa){
	if (edge[u].size()==1){
		ans[u]=1;
		return;
	} 
	int cnt=0;
	for (int v:edge[u]){
		if (v==fa) continue;
		dfs(v,u);
		cnt+=ans[v];
	}
	if (cnt>=2) ans[u]=1;
}

void solution()
{
	cin>>n;
	for (int i=1,u,v;i<n;i++){
		cin>>u>>v;
		edge[u].push_back(v);
		edge[v].push_back(u);
	}
	if (n==1||edge[1].size()==1) cout<<"You win, temporarily."<<endl;
	else{
		dfs(1,0);
		if (ans[1]) cout<<"You win, temporarily."<<endl;
		else cout<<"Wasted."<<endl;
	}
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int T = 1;
   // cin >> T;
    for (int i=1;i<=T;i++) {
        try {
			cerr<<"Case #"<<i<<": "<<endl;
            solution();
        } catch (const char* e) {
            cerr << "Caught exception in solution: " << e << endl;
        }
    }
    return 0;
}