#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using ull = uint64_t;
const ll INF = 9e18;
void print() { cout << endl; }
template <typename Head, typename... Tail>
void print(Head head, Tail... tail) {
  int size = sizeof...(Tail);
  cout << head;
  if (size > 0) {
    cout << " ";
  }
  print(tail...);
}
void print0() {}
template <typename Head, typename... Tail>
void print0(Head head, Tail... tail) {
  cout << head;
  print0(tail...);
}
vector<ll> mkprimes(ll N) {
  vector<bool> isprime(N + 1);
  vector<ll> primes;
  for (ll i = 0; i <= N; i++) {
    isprime[i] = true;
  }
  isprime[0] = false;
  isprime[1] = false;
  for (ll i = 2; i <= N; i++) {
    if (isprime[i]) {
      primes.push_back(i);
      for (ll j = 2 * i; j <= N; j += i) {
        isprime[j] = false;
      }
    }
  }
  return primes;
}
int main() {
  ll N;
  cin >> N;
  vector<ll> A(N);
  for (ll i = 0; i < N; i++) {
    cin >> A[i];
  }
  auto primes = mkprimes(1001);
  vector<vector<ll>> factors(N);
  for (ll i = 0; i < N; i++) {
    ll mx = 1.0 + sqrt(A[i]);
    for (ll p = 0; p < primes.size(); p++) {
      ll pr = primes[p];
      if (A[i] % pr == 0) {
        factors[i].push_back(pr);
      }
      if (pr >= mx) {
        break;
      }
    }
  }
  print("pairwise coprime");
}
