#include <bits/stdc++.h>
using namespace std;
string a, ls, kong, du = "duck", go = "goose";
struct node
{
    string name, zl, dd;
} e[1005];
int n, len;
map<string, bool> pd;
int main()
{
    // freopen("input.in", "r", stdin);
    // freopen("output.out", "w", stdout);
    scanf("%d", &n);
    for (int i = 1; i <= n; i++)
    {
        cin >> e[i].name;
        cin >> a;
        cin >> a;
        cin >> a;
        a.erase(a.end() - 1);
        e[i].zl = a;
        cin >> a;
        cin >> a;
        cin >> a;
        cin >> e[i].dd;
        if (e[i].zl == du)
        {
            pd[e[i].dd] = 1;
        }
    }
    for (int i = 1; i <= n; i++)
    {
        cout << e[i].name << " "
             << "is"
             << " ";
        if (e[i].zl == go && pd[e[i].dd] == 1)
        {
            cout << "dead" << endl;
        }
        else
        {
            cout << "alive" << endl;
        }
    }
    // fclose(stdin);
    // fclose(stdout);
    // system("pause");
    return 0;
}