#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3fLL;
const double PI = acos(-1.0);
const long double eps = 1e-8;
const int mod = 1e9 + 7;
const int maxn = 3e5 + 100;
const int N = 1e6 + 1000;
const int M = 500 + 10;
const long long mm = (1LL << 32);
template <class T>
inline void read(T &x) {
  x = 0;
  char c = getchar();
  bool f = 0;
  for (; !isdigit(c); c = getchar()) f ^= c == '-';
  for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
  x = f ? -x : x;
}
template <class T>
inline void write(T x) {
  if (x < 0) {
    putchar('-');
    x = -x;
  }
  T y = 1;
  int len = 1;
  for (; y <= x / 10; y *= 10) ++len;
  for (; len; --len, x %= y, y /= 10) putchar(x / y + 48);
}
long long qpow(long long a, long long b, long long mod) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = (ans * a) % mod;
    b >>= 1;
    a = (a * a) % mod;
  }
  return ans;
}
int vis[N], a[N];
int tot, prime[N];
void init() {
  for (int i = 2; i < N; ++i) {
    if (!vis[i]) prime[tot++] = i;
    for (int j = 0; j < tot; ++j) {
      if (i * prime[j] > N) break;
      vis[i * prime[j]] = 1;
    }
  }
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
  init();
  int n;
  read(n);
  for (int i = 1; i <= n; ++i) read(a[i]);
  int flag = 1, tag = 0;
  for (int i = 1; i <= n; ++i) {
    if (a[i] == 1) {
      tag = 1;
      continue;
    }
    int x = a[i];
    for (int j = 0; j < tot && prime[j] <= x; ++j) {
      if (x % prime[j] == 0) {
        while (x % prime[j] == 0) x /= prime[j];
        if (vis[prime[j]] == 0) {
          flag = 0;
          break;
        } else
          vis[prime[j]] = 1;
      }
    }
    if (!flag) break;
  }
  if (flag) {
    puts("pairwise coprime");
    return 0;
  }
  int ans = a[1];
  for (int i = 2; i <= n; ++i) ans = gcd(ans, a[i]);
  if (ans == 1)
    puts("setwise coprime");
  else
    puts("not coprime");
  return 0;
}
