#include <bits/stdc++.h>
 
//#define int long long
#define help {cin.tie(NULL); cout.tie(NULL);}
#define pb push_back
#define fi first
#define se second
#define mkp make_pair
using namespace std;
 
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
 
template <typename T> bool chkMax(T &x, T y) { return (y > x) ? x = y, 1 : 0; }
template <typename T> bool chkMin(T &x, T y) { return (y < x) ? x = y, 1 : 0; }
 
template <typename T> void inline read(T &x) {
    int f = 1; x = 0; char s = getchar();
    while (s < '0' || s > '9') { if (s == '-') f = -1; s = getchar(); }
    while (s <= '9' && s >= '0') x = x * 10 + (s ^ 48), s = getchar();
    x *= f;
}

const int N=20005;
int n,f[N],a[N],t;
int main()
{
    for(cin>>t;t;t--)
    {
    	cin>>n;
    	int mx=0;
    	for(int i=1;i<=n;i++)cin>>a[i],mx=max(mx,a[i]);
    	for(int i=0;i<=2*mx;i++)f[i]=0x3f3f3f3f;
    	sort(a+1,a+1+n);
    	f[0]=0;
    	for(int i=1;i<=n;i++)
    		for(int j=a[i];j<=2*mx;j++)f[j]=min(f[j],f[j-a[i]]+1);
    	bool fl=true;
    	for(int i=2*mx;i>=1;i--)
    	{
    		fl=true;
    		int pos=upper_bound(a+1,a+1+n,i)-a-1;
    		
    		int j=i;
    		int res=0;
    		while(j&&pos>=1)
    		{
    			res+=j/a[pos];
    			j-=j/a[pos]*a[pos];
    			pos--;
    		}
    		if(res>f[i])
    		{
    			fl=false;
    			break;
    		}
    	}
    	puts(fl?"DA":"NE");
    }
    return 0;
}