#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define all(a) (a).begin(), (a).end()
template<typename T = int> using V = vector<T>;
template<typename T = int> using P = pair<T, T>;
using Vi = V<int>;
using Vl = V<ll>;
using Vd = V<ld>;
using Vb = V<bool>;
using VVi = V<Vi>;
using VVl = V<Vl>;
using VVb = V<Vb>;
using Pi = P<int>;
using Pl = P<ll>;
using Pd = P<ld>;
template<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }
template<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }
template<typename T> inline int sz(T &x) { return x.size(); }
template<typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }
template<typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { os << '(' << p.first << ", " << p.second << ')'; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v) { for (auto &e : v) is >> e; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }
template<typename T> inline int count_between(vector<T> &a, T l, T r) { return lower_bound(all(a), r) - lower_bound(all(a), l); } // [l, r)
inline int fLog2(const ll x) { assert(x > 0); return 63-__builtin_clzll(x); } // floor(log2(x))
inline int cLog2(const ll x) { assert(x > 0); return (x == 1) ? 0 : 64-__builtin_clzll(x-1); } // ceil(log2(x))
inline int popcount(const ll x) { return __builtin_popcountll(x); }
inline void fail() { cout << -1 << '\n'; exit(0); }
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
// const int INF  = 1<<30;
// const ll INFll = 1ll<<60;
// const ld EPS   = 1e-10;
// const ld PI    = acos(-1.0);
// const int MOD  = int(1e9)+7;
// const int MOD  = 998244353;


struct Eratosthenes {
  vector<bool> isprime;
  vector<int> primes, min_factor;
  Eratosthenes(ll MAX) : isprime(MAX+1, true), min_factor(MAX+1) {
    isprime[0] = isprime[1] = false;
    min_factor[1] = 1;
    for (ll i = 2; i <= MAX; ++i) if (isprime[i]) {
      primes.push_back(i);
      min_factor[i] = i;
      for (ll j = i*i; j <= MAX; j += i) {
        isprime[j] = false;
        if (min_factor[j] == 0) min_factor[j] = i;
      }
    }
  }
  // prime factorization
  vector<pair<int, int>> factorize(int n) {
    vector<pair<int, int>> res;
    while (n != 1) {
      int prime = min_factor[n];
      int exp = 0;
      while (min_factor[n] == prime) { ++exp; n /= prime; }
      res.emplace_back(prime, exp);
    }
    return res;
  }
  // enumerate divisors
  vector<int> divisors(int n) {
    vector<int> res({1});
    for (auto [p, e] : factorize(n)) {
      int k = res.size();
      rep(i, k) {
        int v = 1;
        rep(j, e) { v *= p; res.push_back(res[i] * v); }
      }
    }
    return res;
  }
};

const int M = int(1e6)+3;


int main() {
  ll n; cin >> n;
  Vi a(n); cin >> a;

  int g = a[0];
  rep(i, n) {
    g = gcd(g, a[i]);
    if (g == 1) break;
  }

  if (g > 1) {
    cout << "not coprime\n";
    return 0;
  }

  Eratosthenes er(M);

  Vi cnt(M);
  rep(i, n) {
    for (auto [a, b] : er.factorize(a[i])) ++cnt[a];
  }

  bool pw = true;
  rep(i, M) if (cnt[i] > 1) pw = false;

  if (pw) cout << "pairwise coprime\n";
  else cout << "setwise coprime\n";
}


Measured memory_bytes: 15592