#include <bits/stdc++.h>
using namespace std;
int A[200005];
int para[200005];
int parb[200005];
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n + 1; ++i) {
    scanf("%d", &A[i]);
  }
  int flag = 0;
  int prev = 1;
  for (int i = 1; i <= n + 1; ++i) {
    if (prev != 1 && A[i] != 1) {
      flag = 1;
      break;
    }
    prev = A[i];
  }
  if (!flag) {
    cout << "perfect" << endl;
    return 0;
  }
  cout << "ambiguous" << endl;
  int coun = 1;
  int par1, par2;
  par1 = par2 = 1;
  prev = 1;
  flag = 0;
  for (int i = 2; i <= n + 1; ++i) {
    if (prev != 1 && A[i] != 1) {
      for (int j = coun + 1; j <= coun + A[i]; ++j) para[j] = par1;
      for (int j = coun + 1; j < coun + A[i]; ++j) parb[j] = par1;
      parb[coun + A[i]] = par2;
      par1 = coun + 1;
      par2 = coun + A[i];
      coun += A[i];
      flag = 1;
    } else if (prev == 1 && A[i] != 1) {
      for (int j = coun + 1; j <= coun + A[i]; ++j) para[j] = par1;
      for (int j = coun + 1; j <= coun + A[i]; ++j) parb[j] = par1;
      par1 = coun + 1;
      par2 = coun + 2;
      coun += A[i];
    } else if (prev == 1 && A[i] == 1) {
      para[coun + 1] = par1;
      parb[coun + 1] = par1;
      par1 = coun + 1;
      ++coun;
    } else if (prev != 1 && A[i] == 1) {
      para[coun + 1] = par1;
      parb[coun + 1] = par2;
      par1 = coun + 1;
      ++coun;
    }
    prev = A[i];
  }
  for (int i = 1; i <= coun; ++i) {
    printf("%d ", para[i]);
  }
  cout << endl;
  for (int i = 1; i <= coun; ++i) {
    printf("%d ", parb[i]);
  }
  cout << endl;
  return 0;
}
