#include <iostream>
#include <algorithm>
using namespace std;
int a[100001],i,n,x,k,j,maxi;
int main()
{
    cin>>n;
    for(i=1;i<=n;i++)cin>>a[i];
    sort(a+1,a+n+1);
    for(i=1;i<=n;i++)
   {
       if(a[i]==a[i+1])x++;
       else
       {
           if(x>maxi){maxi=x;k=a[i];}
       }
   }
   if(maxi>x/2)cout<<"DA"<<" "<<k;
   else cout<<"NU";
    return 0;
}