#include <bits/stdc++.h>
using namespace std;
void sort(int A[], int l, int r) {
  if (r - l < 2) {
    return;
  }
  int mid = (r + l) / 2;
  sort(A, l, mid);
  sort(A, mid, r);
  int B[r - l];
  int x = l;
  int y = mid;
  for (int i = 0; i < r - l; i++) {
    if (A[x] <= A[y] && x < mid && y < r) {
      B[i] = A[x];
      B[i] = A[x];
      x++;
    } else if (y < r) {
      B[i] = A[y];
      B[i] = A[y];
      y++;
    } else {
      B[i] = A[x];
      B[i] = A[x];
      x++;
    }
  }
  for (int i = 0; i < r - l; i++) {
    A[l + i] = B[i];
    A[l + i] = B[i];
  }
}
int GCD(int u, int v) {
  while (v != 0) {
    int r = u % v;
    u = v;
    v = r;
  }
  return u;
}
int x[1000000];
int y[1000000];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int h, flag = 1, c = 0, p, sth, f, l = 0, g = 1, ho, a = 1;
  cin >> h;
  for (int i = 0; i <= h; i++) {
    cin >> x[i];
    if (i != 0)
      if (x[i] > 1 && x[i - 1] > 1) {
        flag = 0;
        sth = i;
      }
  }
  if (flag) {
    cout << "perfect";
    return 0;
  } else {
    cout << "ambiguous" << '\n';
  }
  y[c++] = 0;
  for (int i = 0; i <= h; i++) {
    p = c - 1;
    if (i == sth) ho = p;
    for (int j = 0; j < x[i]; j++) {
      y[c++] = p;
    }
  }
  for (int j = 1; j < c; j++) {
    cout << y[j] << ' ';
  }
  cout << '\n';
  for (int j = 1; j < c; j++) {
    if (y[j] == ho && a) {
      y[j] = ho - 1;
      a = 0;
    }
  }
  for (int j = 1; j < c; j++) {
    cout << y[j] << ' ';
  }
  return 0;
}
