#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-9;
const double PI = acos(-1);
const long long MOD = 1e9 + 7;
const int dCol[] = {0, +1, 0, -1, +1, +1, -1, -1};
const int dRow[] = {-1, 0, +1, 0, -1, +1, +1, -1};
int H, total = 0;
int a[100005], parent[2000005], akhir[2000005];
bool ambigu = 0;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  memset(a, 0, sizeof a);
  memset(parent, 0, sizeof parent);
  memset(akhir, 0, sizeof akhir);
  a[0] = 1;
  cin >> H;
  for (int i = 1; i <= H + 1; i++) {
    cin >> a[i];
    total += a[i];
    akhir[i] = akhir[i - 1] + a[i];
    if (a[i] >= 2 && a[i - 1] >= 2) ambigu = 1;
  }
  if (ambigu) {
    cout << "ambiguous"
         << "\n";
    for (int i = 1; i <= H + 1; i++) {
      for (int j = 0; j < a[i]; j++) {
        parent[akhir[i] - j] = akhir[i - 1];
      }
    }
    for (int i = 1; i <= total; i++) {
      cout << parent[i];
      if (i == total)
        cout << "\n";
      else
        cout << " ";
    }
    for (int i = 1; i <= H + 1; i++) {
      for (int j = 0; j < a[i]; j++) {
        parent[akhir[i] - j] = (akhir[i - 1] - a[i - 1] + 1) + (j % a[i - 1]);
      }
    }
    for (int i = 1; i <= total; i++) {
      cout << parent[i];
      if (i == total)
        cout << "\n";
      else
        cout << " ";
    }
  } else
    cout << "perfect"
         << "\n";
  return 0;
}
