#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<cstring>
#include<cmath>
#include<vector>
#include<queue>
using namespace std;
int n,a[30];
string s;

main()
{
	int i,j,ans=0;
	scanf("%d",&n);
	for(i=1;i<=n;++i)
	{
	  ans=0;
	  gets(s);memset(a,0,sizeof(a));
	  for(j=0;j<s.size();++j)
	    if(s[j]>='A'&&s[j]<='Z') s[j]+=32;
	  for(j=0;j<s.size();++j)
	  {
		if(a[s[j]-96])
	    {	
		++ans;a[s[j]-96]=0;
		}
		else a[s[j]-96]=1;
	  }
	  if(ans>=2) printf("de1ete\n");
	    else printf("safe\n");
	}
	return 0;
}