#include<bits/stdc++.h>

using namespace std;

#define endl '\n'

#define TRACE 1
#define tcout TRACE && cout

#define int long long

#define fst ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

const int P = 998244353;

const int N = 1e3 + 10;

int n;

struct Node
{
	string name, id, place;
}a[N];

signed main()
{
	cin >> n;
	for(int i=1; i<=n; i++)
	{
		string k;
		cin >> a[i].name >> k >> k >> a[i].id >> k >> k >> k >> a[i].place;
	}
//	cout << endl;
//	for(int i=1; i<=n; i++)
//	{
//		cout << a[i].name << " " << a[i].id << " " << a[i].place << endl;
//	}
//	cout << endl;
	for(int i=1; i<=n; i++)
	{
		if(a[i].id == "duck,")
		{
			cout << a[i].name << " is alive" << endl;
			continue;
		}
		bool flag = 1;
		for(int j=1; j<=n; j++)
		{
			if(a[i].place == a[j].place)
			{
				if(a[i].id == "goose," && a[j].id == "duck,")
				{
					cout << a[i].name << " is dead" << endl;
					flag = 0;
					break;
				}
			}
		}
		if(flag)
		{
			cout << a[i].name << " is alive" << endl;
		}
	}
	return 0;
}