#include <bits/stdc++.h>
using namespace std;

int n, sum, flag;
string s;
struct node {
	string id, place;
};
unordered_map<string, node> m;
unordered_map<string, node>::iterator it;
unordered_map<string, node>::iterator it2;
unordered_map<string, int> us;

struct USER {
	string name;
	bool live;
} user[1001];

inline int read() {
	int f = 1, x = 0;
	char ch = getchar();
	while (ch < '0' || ch > '9') {
		if (ch == '-') {
			f = -1;
		}
		ch = getchar();
	}
	while (ch >= '0' && ch <= '9') {
		x = (x << 3) + (x << 1) + (ch - 48);
		ch = getchar();
	}
	return ~f ? x : -x;
}

signed main() {
	n = read();
	for (int i = 1; i <= n; i++) {
		string fk, nm, idd, pc;
		cin >> nm >> fk >> fk >> idd >> fk >> fk >> fk >> pc;
		m[nm].id = idd;
		m[nm].place = pc;
		us[nm] = i;
		user[i].name = nm;
	}
	for (it = m.begin(); it != m.end(); it++) {
		pair<string, node> temp1 = *it;
		if (temp1.second.id == "duck,") {
//			cout << temp1.first << ' ' << "is" << ' ' << "alive" << '\n';
			user[us[temp1.first]].live = 1;
			continue;
		}
		for (it2 = m.begin(); it2 != m.end(); it2++) {
			if (it2 == it) {
				continue;
			}
			pair<string, node> temp2 = *it2;
			if ((temp1.second.id != temp2.second.id) && (temp1.second.place == temp2.second.place)) {
				user[us[temp1.first]].live = 0;
//				cout << temp1.first << ' ' << "is" << ' ' << "dead" << '\n';
				flag = 1;
				break;
			}
		}
		if (!flag) {
//			cout << temp1.first << ' ' << "is" << ' ' << "alive" << '\n';
			user[us[temp1.first]].live = 1;
		}
		flag = 0;
	}
	for (int i = 1; i <= n; i++) {
		if (user[i].live) {
			cout << user[i].name << ' ' << "is" << ' ' << "alive" << '\n';
		} else {
			cout << user[i].name << ' ' << "is" << ' ' << "dead" << '\n';
		}
	}
	return 0;
}