#include <vector>
#include <cstdio>
#include <iostream>

using namespace std;

const int M = 524288 + 7;
const int N = 262144 + 7;
int n, m, x;
int a[M], t[N];
vector <int> u[N];

void arb(int l, int r) {
  if (l > r) {
    printf("NU\n");
    exit(0);
  }
  if (l == r) {
    return;
  }
  if (a[l] != a[r]) {
    printf("NU\n");
    exit(0);
  }
  for (int i = 0; i + 1 < (int) u[a[l]].size(); i++) {
    int ln = u[a[l]][i] + 1, rn = u[a[l]][i + 1] - 1;
    t[a[ln]] = a[l];
    arb(ln, rn);
  }
}

int main() {
  freopen ("euler.in", "r", stdin);
  freopen ("euler.out", "w", stdout);

  cin >> n;
  int x;
  while (cin >> x) {
    a[++m] = x;
    u[x].push_back(m);
  }

  arb(1, m);
  int cnt0 = 0;
  for (int i = 1; i <= n; i++) {
    cnt0 += (t[i] == 0);
  }

  if (cnt0 == 1) {
    printf("DA\n");
    for (int i = 1; i <= n; i++) {
      printf("%d ", t[i]);
    }
    printf("\n");
  } else {
    printf("NU\n");
  }

  return 0;
}