#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 5;

vector<int> G[N];
int f[N];

void dfs(int x, int fa = -1)
{
    if ((int)G[x].size() == 1 && ~fa) {
        f[x] = 1e9;
    } else {
        vector<int> sz;
        for (auto v : G[x]) {
            if (v != fa) {
                dfs(v, x);
                if (f[v]) {
                    sz.push_back(f[v]);
                }
            }
        }
        if (sz.empty()) {
            f[x] = 0;
        } else {
            f[x] = max((int)sz.size() - 1, 0);
        }
    }
    return;
}

signed main()
{
    int n;
    scanf("%d", &n);
    if (n == 1) {
        puts("Wasted.");
        return 0;
    }
    for (int i = 1, x, y; i < n; ++i) {
        scanf("%d%d", &x, &y);
        G[x].push_back(y);
        G[y].push_back(x);
    }
    dfs(1);
    if (f[1] > 0) {
        puts("You win, temporarily.");
    } else {
        puts("Wasted.");
    }
    return 0;
}