#include<bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define ll long long
#define abs(a) (a > 0 ? (a) : -(a))
static ll max(ll a, ll b) { return a > b ? a : b; }
static ll min(ll a, ll b) { return a < b ? a : b; }
using namespace std;

const int N = 1e5 + 9;
vector<int> adj[100005];
int d[100005];

bool dfs(int node) {
    int s = 0;
    for (int i = 0; i < adj[node].size(); i++)
    {
        s += dfs(adj[node][i]);
    }
    if (adj[node].size()==0)return 1;
    if (s >= 2) {
        return 1;
    }
    else return 0;
}

int main() {
    int n;
    cin >> n;
    for (int i = 0; i < n - 1; ++i) {
        int u, v;
        cin >> u >> v;
        adj[u].push_back(v);
    }

    if (n == 1) {
        cout << "Wasted." << endl;
        return 0;
    }
    if (dfs(1)) {
        cout << "You win, temporarily." << endl;
    }
    else {
        cout << "Wasted." << endl;
    }

    return 0;
}