#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const double tiaohe = 0.57721566490153286060651209;
long long oula(long long x) {
  long long res = x;
  for (register int i = 2; i <= x / i; ++i) {
    if (x % i == 0) {
      res = res / i * (i - 1);
      while (x % i == 0) x /= i;
    }
  }
  if (x > 1) res = res / x * (x - 1);
  return res;
}
long long quickmod(long long a, long long n, long long m) {
  long long s = 1;
  while (n) {
    if (n & 1) {
      s = s * a % m;
    }
    a = (a * a) % m;
    n = n / 2;
  }
  return s;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
void ex_gcd(long long a, long long b, long long &x, long long &y,
            long long &d) {
  if (!b) {
    d = a, x = 1, y = 0;
  } else {
    ex_gcd(b, a % b, y, x, d);
    y -= x * (a / b);
  }
}
long long inv(long long t, long long p) {
  long long d, x, y;
  ex_gcd(t, p, x, y, d);
  return d == 1 ? (x % p + p) % p : -1;
}
bool isPrime(long long x) {
  if (x == 2) return true;
  if (x % 2 == 0) return false;
  for (long long i = 2; i * i <= x; i++)
    if (x % i == 0) return false;
  return true;
}
inline int in() {
  char ch = getchar();
  int x = 0, f = 1;
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
double eqa = (1 + sqrt(5.0)) / 2.0;
const int N = 1e6 + 5;
bool vis[N + 1];
long long p[N + 1], cnt;
void x_x() {
  for (register int i = 2; i <= N; ++i) {
    if (!vis[i]) p[++cnt] = i;
    for (int j = 1; p[j] <= N / i; j++) {
      vis[p[j] * i] = true;
      if (i % p[j] == 0) break;
    }
  }
}
vector<int> G[N];
int a[N];
int main() {
  x_x();
  int n;
  n = in();
  for (register int i = 1; i <= n; ++i) a[i] = in();
  map<int, int> mp;
  int fg = 1;
  for (register int i = 1; i <= n; ++i) {
    for (int j = 1; j <= cnt && p[j] * p[j] <= a[i]; j++) {
      if (a[i] % p[j] == 0) {
        int cot = 0;
        while (a[i] % p[j] == 0) {
          a[i] /= p[j];
          cot++;
        }
        mp[p[j]]++;
        if (G[p[j]].empty()) {
          G[p[j]].emplace_back(a[i]);
        } else {
          if (G[p[j]][0] != a[i]) {
            fg = 0;
          }
        }
      }
    }
    if (a[i] > 1) {
      mp[a[i]]++;
      if (G[a[i]].empty()) {
        G[a[i]].emplace_back(a[i]);
      } else {
        if (G[a[i]][0] != a[i]) {
          fg = 0;
        }
      }
    }
  }
  if (fg)
    puts("pairwise coprime");
  else {
    int mx = 0;
    for (auto i : mp) {
      if (i.second == n) {
        mx = 1;
        break;
      }
    }
    if (mx == 1)
      puts("not coprime");
    else
      puts("setwise coprime");
  }
  return 0;
}
