#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<long long>;
using pii = pair<long long, long long>;
const long long DX[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0},
                DY[9] = {-1, 0, 1, 0, -1, 1, 1, -1, 0};
template <class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (auto i = (begin(v)); i != (end(v)); ++i)
    os << *i << (i == end(v) - 1 ? "" : " ");
  return os;
}
template <class T>
istream &operator>>(istream &is, vector<T> &v) {
  for (auto i = (begin(v)); i != (end(v)); ++i) is >> *i;
  return is;
}
template <class T>
istream &operator>>(istream &is, pair<T, T> &p) {
  is >> p.first >> p.second;
  return is;
}
template <class T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
using heap = priority_queue<T, vector<T>, greater<T>>;
struct before_main_function {
  before_main_function() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << setprecision(15) << fixed;
  }
} before_main_function;
signed main() {
  long long h;
  cin >> h;
  vector<long long> a(h + 1);
  cin >> a;
  long long n = accumulate(begin(a), end(a), 0ll);
  long long cnt = 1;
  vector<long long> p(1, 0);
  vector<long long> ans1(n, -1);
  vector<long long> ans2(n, -1);
  bool perfect = 1;
  for (long long i = 1, ilen = (long long)(h + 1); i < ilen; ++i) {
    vector<long long> next_p;
    if (((long long)p.size()) == 1) {
      for (long long j = 0, jlen = (long long)(a[i]); j < jlen; ++j) {
        ans1[cnt] = p[0];
        ans2[cnt] = p[0];
        next_p.push_back(cnt);
        cnt++;
      }
    } else {
      if (a[i] == 1) {
        for (long long j = 0, jlen = (long long)(a[i]); j < jlen; ++j) {
          ans1[cnt] = p[0];
          ans2[cnt] = p[0];
          next_p.push_back(cnt);
          cnt++;
        }
      } else {
        perfect = 0;
        for (long long j = 0, jlen = (long long)(a[i] - 1); j < jlen; ++j) {
          ans1[cnt] = p[0];
          ans2[cnt] = p[0];
          next_p.push_back(cnt);
          cnt++;
        }
        ans1[cnt] = p[1];
        ans2[cnt] = p[0];
        next_p.push_back(cnt);
        cnt++;
      }
    }
    p = next_p;
  }
  if (perfect) {
    cout << "perfect"
         << "\n";
  } else {
    cout << "ambiguous"
         << "\n";
    for (long long i = 0, ilen = (long long)(n); i < ilen; ++i)
      ans1[i]++, ans2[i]++;
    cout << ans1 << "\n";
    cout << ans2 << "\n";
  }
  return 0;
}
