#include<bits/stdc++.h>
using namespace std;
int n;
struct zzz {
	int num,orders;
	string places,names,ans;
	bool have;
};
zzz a[1010];
bool cmp(zzz x,zzz y) {
	if(x.num==y.num) {
		return x.places<y.places;
	}
	return x.num>y.num;
}
bool cmp2(zzz x,zzz y) {
	return x.orders<y.orders;
}
int main() {
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	cin>>n;
	string ans1="alive",ans2="dead";
	string x1,x2,x3,x4,x5,x6,y1,y2;
	char xx;
	int l=0;
	for(int i=1; i<=n; i++) {
		cin>>a[i].names>>x1>>x2>>y1>>x4>>x5>>x6>>y2;
		//cout<<a[i].names<<" "<<y1<<" "<<y2<<endl;
		a[i].orders=i;
		if(y1=="duck,") {
			a[i].num=2;
			a[i].places=y2;
			a[i].ans=ans1;
		} else {
			l++;
			a[i].num=1;
			a[i].places=y2;
		}
	}
	sort(a+1,a+1+n,cmp);
//	cout<<l<<" "<<n-l+1<<endl;
//	for(int i=1; i<=n; i++) {
//		cout<<a[i].names<<" "<<a[i].num<<" "<<a[i].places<<endl;
//	}
//	cout<<endl;
	if(n-l==0) {
		for(int i=1; i<=n; i++)
			a[i].ans=ans1;
	}
	for(int i=1; i<=n-l; i++) {
		for(int j=n-l+1; j<=n; j++) {
			if(a[j].have==0) {
				if(a[i].places==a[j].places) {
					a[j].ans=ans2;
					a[j].have=1;
				} else {
					a[j].ans=ans1;

				}
			}

		}
	}
	sort(a+1,a+1+n,cmp2);
	for(int i=1; i<=n; i++) {
		cout<<a[i].names<<" is "<<a[i].ans<<endl;
	}
	return 0;
}