t = int(input())
for i in range(t):
one = 0
zero = 0
s = input()
n = len(s)
for j in range(n):
if s[j] == '1':
one+=1
else:
zero+=1
turn = min(zero,one)
if turn == 0 or turn%2 == 0:
print("NET")
else:
print("DA")#include<iostream>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
string s;
cin>>s;
int n=s.size();
int cnt0=0,cnt1=0;
for (int i=0;i<n;i++){
if (s[i]=='0'){
cnt0++;
}
if (s[i]=='1'){
cnt1++;
}
}
if (min(cnt0,cnt1)%2==0){
cout<<"NET"<<endl;
}
else{
cout<<"DA"<<endl;
}
}
return 0;
}1581A - CQXYM Count Permutations | 337A - Puzzles |
495A - Digital Counter | 796A - Buying A House |
67A - Partial Teacher | 116A - Tram |
1472B - Fair Division | 1281C - Cut and Paste |
141A - Amusing Joke | 112A - Petya and Strings |
677A - Vanya and Fence | 1621A - Stable Arrangement of Rooks |
472A - Design Tutorial Learn from Math | 1368A - C+= |
450A - Jzzhu and Children | 546A - Soldier and Bananas |
32B - Borze | 1651B - Prove Him Wrong |
381A - Sereja and Dima | 41A - Translation |
1559A - Mocha and Math | 832A - Sasha and Sticks |
292B - Network Topology | 1339A - Filling Diamonds |
910A - The Way to Home | 617A - Elephant |
48A - Rock-paper-scissors | 294A - Shaass and Oskols |
1213A - Chips Moving | 490A - Team Olympiad |