#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
const int inf = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const double eps = 1e-6;
const double pi = acos(-1.0);
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long qpow(long long x, long long y) {
  long long ans = 1;
  for (; y > 0; y >>= 1) {
    if (y & 1) ans *= x;
    x *= x;
  }
  return ans;
}
long long qpow(long long x, long long y, int MOD) {
  long long ans = 1;
  for (; y > 0; y >>= 1) {
    if (y & 1) ans = ans * x % MOD;
    x = x * x % MOD;
  }
  return ans;
}
void exgcd(long long a, long long b, long long &x, long long &y) {
  if (!b) {
    x = 1;
    y = 0;
    return;
  }
  exgcd(b, a % b, x, y);
  long long X = x;
  x = y;
  y = X - a / b * y;
}
long long inv(long long x, int mod = MOD) { return qpow(x, mod - 2, mod); }
long long m_m(long long a) { return (a % MOD + MOD) % MOD; }
const int N = 1e6;
int cp;
int pri[N + 5];
int pl[N + 5];
void e_p() {
  for (int i = (2); i < (1e3 + 5); ++i) {
    if (!pl[i]) pri[cp++] = i;
    for (int j = 0; j < cp && i * pri[j] <= 1005; ++j) {
      pl[i * pri[j]] = 1;
      if (i % pri[j] == 0) break;
    }
  }
}
int cnt[1005];
signed main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  int n;
  cin >> n;
  e_p();
  int g = 0;
  for (int i = (0); i < (n); ++i) {
    int x;
    cin >> x;
    g = gcd(g, x);
    for (int i = 0; pri[i] * pri[i] <= x; ++i) {
      if (x % pri[i] == 0) {
        ++cnt[pri[i]];
        while (x % pri[i] == 0) x /= pri[i];
      }
    }
    if (pl[x]) ++cnt[x];
  }
  int f = 1;
  for (int i = (2); i < (1005); ++i) {
    if (cnt[i] > 1) {
      f = 0;
      break;
    }
  }
  if (f)
    cout << "pairwise coprime";
  else if (g == 1)
    cout << "setwise coprime";
  else
    cout << "no coprime";
  return 0;
}
