#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template <class T>
using vec = vector<T>;
template <class T>
using vvec = vector<vec<T>>;
using tp = tuple<ll, ll, ll>;
constexpr long long INF = 1LL << 60;
constexpr int INF_INT = 1 << 25;
constexpr long long MOD = (ll)1e9 + 7;
using ld = long double;
static const ld pi = 3.141592653589793L;
template <class T>
inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
struct Edge {
  ll to, cap, rev;
  Edge(ll _to, ll _cap, ll _rev) {
    to = _to;
    cap = _cap;
    rev = _rev;
  }
};
void add_edge(vector<vector<Edge>> &G, ll from, ll to, ll cap, bool revFlag,
              ll revCap) {
  G[from].push_back(Edge(to, cap, (ll)G[to].size()));
  if (revFlag) G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1));
}
void solve() {
  ll n;
  cin >> n;
  vec<ll> a(n);
  vec<ll> con(1010101, 0);
  for (int(i) = (int)(0); i < (int)(n); ++i) {
    cin >> a[i];
    con[a[i]]++;
  }
  vec<int> arr(1010101, 1);
  ll m = 1000000;
  bool flag = false;
  bool flag2 = false;
  for (ll i = 2; i * i <= m; i++) {
    if (arr[i]) {
      ll tmp = con[i];
      for (ll j = 2; i * j <= m; j++) {
        arr[i * j] = 0;
        tmp += con[i * j];
      }
      if (tmp >= 2) flag = true;
      if (tmp == n) flag2 = true;
    }
  }
  if (flag2) {
    cout << "not coprime" << '\n';
  } else if (flag) {
    cout << "setwise coprime" << '\n';
  } else {
    cout << "pairwise coprime" << '\n';
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  solve();
  return 0;
}
