#include <bits/stdc++.h>
using namespace std;
#define PII pair<ll, ll>
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
#define fo(i, l, r) for (int i = l; i <= r; i++)
#define of(i, l, r) for (int i = l; i >= r; i--)
#define mem(a, b) memset(a, b, sizeof(a))
#define F first
#define S second
const double pi = acos(-1.0);
const ll LNF = 0x3f3f3f3f3f3f3f3f;
const int INF = 0x3f3f3f3f;
const ll MOD = 998244353;
const ll mod = 1e9+7;
const int N = 1e5+50;
const int M = 1e5+50;
const int MAXN=150;

map<ll, ll> mp, sb;
vector<ll> a[N];
int vis[N];
ll n;

void dfs(ll p)
{
    vis[p] = 1;
    if(a[p].size()==1)
    {
        return;
    }
    for(auto i:a[p])
    {
        if(!vis[i])
        {
            sb[i] = p;
            dfs(i);
        }
    }
    return;
}

void Solve()
{
    cin >> n;
    fo(i, 1, n-1)
    {
        ll l, r;
        cin >> l >> r;
        a[l].push_back(r);
        a[r].push_back(l);
    }
    if(n==2)
    {
        cout << "You win, temporarily." << '\n';
        return;
    }
    dfs(1);
    fo(i, 2, n)
    {
        if(a[i].size()==1)
        {
            ll hh=sb[i];
            mp[i] = 1;
            while(hh!=1)
            {
                if(a[hh].size()-1==1)
                {
                    break;
                }
                mp[hh] = 1;
                hh = sb[hh];
            }
        }
    }
    for(auto i:a[1])
    {
        mp[1] += mp[i];
    }
    // cout << mp[1] << '\n';
    if(mp[1]>=2 || n==2)
    {
        cout << "You win, temporarily." << '\n';
    }
    else
    {
        cout << "Wasted." << '\n';
    }
	return;
}

int main(void)
{
	std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int t=1;
	// cin >> t;
	while(t--)
	{
		Solve();
	}
	return 0;
}