#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
int head[100005], cnt, n, l, r, dep[100005], dep1[100005], num[100005];
vector<int>v[100005];

bool cmp1(int a, int b)
{
    if (dep1[a] != dep1[b])
        return dep1[a] < dep1[b];
    else return num[a] > num[b];
}
struct tree
{
    int to;
    int next;
}c[100005];
void add(int a, int b)
{
    v[a].push_back(b);
}
int dfs1(int x)
{
    if (v[x].size() == 0)
    {
        dep1[x]=1;
        return 1;
    }
    for (int i = 0; i<v[x].size(); i++)
    {
        int t=dfs1(v[x][i]);
        if(i==0)dep1[x]=t+1;
        else dep1[x]=min(dep1[x],t+1);
    }
    return dep1[x];
}
int dfs(int x)
{
    if (v[x].size() == 0)
    {
        num[x] = 1;
        return 1;
    }
    for (int i = 0; i < v[x].size(); i++)
    {
        if (dep1[v[x][i]] + 1 == dep1[x])
        {
            num[x] += dfs(v[x][i]);
        }
    }
    return num[x];
}
bool f(int x)
{
    if (dep1[x] == 1)
        return true;
    if (v[x].size() < 2)
        return false;
    sort(v[x].begin(), v[x].end(), cmp1);
    return f(v[x][1]);
}
int main()
{
    cin >> n;
    if( n == 1)
    {
        cout << "Wasted." << endl;
        return 0;
    }
    for (int i = 1; i <= n; i++)
    {
        dep1[i] = 0x3f3f3f3f;
    }
    for (int i = 1; i <= n - 1; i++)
    {
        cin >> l >> r;
        add(l, r);
    }
    dfs1(1);
    //cout<<endl;
    dfs(1);
    bool ff = f(1);
    if (ff)
    {
        cout << "You win, temporarily." << endl;
    }
    else
    {
        cout << "Wasted." << endl;
    }
    return 0;
}