SOLUTIA DE 100 PCT
#include <iostream>
using namespace std;
int n, v[1000001];
unsigned long long int sum;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> v[i];
sum += v[i];
}
int sem = 1;
for (int i = 1; i <= n; i++)
if (v[i] >= sum - v[i])
sem = 0;
if (sem == 1)
cout << "DA";
else
cout << "NU";
return 0;
}