PareOrdonate

#include <iostream>
#include <algorithm>
using namespace std;

int main()
{
    long int v[101],n,j,i;
    cin>>n;
    for(i=1;i<=n;i++)
        cin>>v[i];
    for(i=1;i<=n-1;i++)
    {
        if(v[i]%2==0)
        {
            for(j=i+1;j<=n;j++)
                if(v[j]%2==0 && v[j]<v[i])
                {
                    cout<<"NU";
                    return 0;
                }
        }
    }
    cout<<"DA";
    return 0;
}