#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using namespace std;
template <typename T>
inline bool read(T& ret) {
  T x = 0, f = 1;
  char ch = getchar();
  while (ch != EOF && (ch > '9' || ch < '0')) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  if (EOF == ch) return false;
  do x = x * 10 + ch - 48, ch = getchar();
  while (ch >= '0' && ch <= '9');
  ret = x * f;
  return true;
}
inline char nc() {
  static char buf[100000], *p1 = buf, *p2 = buf;
  return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
             ? EOF
             : *p1++;
}
template <typename T>
bool rn(T& v) {
  static char ch;
  while (ch != EOF && !isdigit(ch)) ch = nc();
  if (ch == EOF) return false;
  for (v = 0; isdigit(ch); ch = nc()) v = v * 10 + ch - '0';
  return true;
}
template <typename T>
void o(T p) {
  static int stk[70], tp;
  if (p == 0) {
    putchar('0');
    return;
  }
  if (p < 0) {
    p = -p;
    putchar('-');
  }
  while (p) stk[++tp] = p % 10, p /= 10;
  while (tp) putchar(stk[tp--] + '0');
}
LL bin(LL x, LL n, LL MOD) {
  LL ret = MOD != 1;
  for (x %= MOD; n; n >>= 1, x = x * x % MOD)
    if (n & 1) ret = ret * x % MOD;
  return ret;
}
inline LL get_inv(LL x, LL p) { return bin(x, p - 2, p); }
void Solve() {}
const int MAXN = 1e6 + 10;
int A[MAXN], cnt[MAXN];
int N;
int gcd(int x, int y) {
  if (y == 0) return x;
  return gcd(y, x % y);
}
int main() {
  while (cin >> N) {
    memset(cnt, 0, sizeof(cnt));
    bool fa = true, fb = true, fc = true;
    int minA = 1e6 + 10, maxA = 0;
    for (int i = 0; i < N; i++) {
      scanf("%d", A + i);
      minA = min(minA, A[i]);
      maxA = max(maxA, A[i]);
      cnt[A[i]]++;
      if (cnt[A[i]] > 1) {
        fa = false;
      }
    }
    int g = gcd(A[0], A[1]);
    for (int i = 2; i < N; i++) {
      g = gcd(g, A[i]);
      if (1 == g) break;
    }
    if (1 != g) {
      puts("not coprime");
      continue;
    }
    if ((!fa)) {
      puts("setwise coprime");
      continue;
    }
    for (int i = 2; i <= maxA; i++) {
      int jmax = sqrt(i) + 1;
      bool flag = true;
      for (int j = 2; j < jmax; j++) {
        if (i % j == 0) {
          flag = false;
        }
      }
      if (!flag) continue;
      int tc = 0;
      for (int ai = 0; ai < N; ai++) {
        if (A[ai] % i == 0) {
          tc++;
          if (tc > 1) {
            fa = false;
            break;
          }
        }
      }
      if (tc > 1) break;
    }
    if (!fa) {
      puts("setwise coprime");
    } else {
      puts("pairwise coprime");
    }
  }
  return 0;
  return 0;
}
