#include <bits/stdc++.h>
using namespace std;
inline long long gcd(long long a, long long b) {
  a = ((a) < 0 ? -(a) : (a));
  b = ((b) < 0 ? -(b) : (b));
  while (b) {
    a = a % b;
    swap(a, b);
  }
  return a;
}
long long ext_gcd(long long A, long long B, long long* X, long long* Y) {
  long long x2, y2, x1, y1, x, y, r2, r1, q, r;
  x2 = 1;
  y2 = 0;
  x1 = 0;
  y1 = 1;
  for (r2 = A, r1 = B; r1 != 0;
       r2 = r1, r1 = r, x2 = x1, y2 = y1, x1 = x, y1 = y) {
    q = r2 / r1;
    r = r2 % r1;
    x = x2 - (q * x1);
    y = y2 - (q * y1);
  }
  *X = x2;
  *Y = y2;
  return r2;
}
inline long long modInv(long long a, long long m) {
  long long x, y;
  ext_gcd(a, m, &x, &y);
  x %= m;
  if (x < 0) x += m;
  return x;
}
inline long long bigmod(long long a, long long p, long long m) {
  long long res = 1 % m, x = a % m;
  while (p) {
    if (p & 1) res = (res * x) % m;
    x = (x * x) % m;
    p >>= 1;
  }
  return res;
}
const long long inf = 2147383647;
const long long mod = 1000000007;
const double pi = 2 * acos(0.0);
const double eps = 1e-11;
vector<int> Prime;
int mark[1000005];
void sieve(int n) {
  int i, j, limit = sqrt(n * 1.0) + 2;
  mark[1] = 1;
  for (i = 4; i <= n; i += 2) mark[i] = 1;
  Prime.push_back(2);
  for (i = 3; i <= n; i += 2) {
    if (!mark[i]) {
      Prime.push_back(i);
      if (i <= limit) {
        for (j = i * i; j <= n; j += i * 2) {
          mark[j] = 1;
        }
      }
    }
  }
}
int n, A[1000005], isDiv[1000005];
void solve() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> A[i];
  }
  for (int i = 0; i < n; i++) {
    int curr = A[i];
    int lim = sqrt(curr);
    for (int j = 0; j < Prime.size(); j++) {
      if (curr >= 4 && Prime[j] > lim)
        break;
      else if (Prime[j] > curr)
        break;
      if (curr % Prime[j] == 0) {
        isDiv[Prime[j]]++;
        if (curr / Prime[j] != Prime[j]) {
          isDiv[curr / Prime[j]]++;
        }
      }
    }
  }
  int flag = 1;
  for (int i = 0; i < 1000005 - 1; i++) {
    if (isDiv[i] > 1) {
      flag = 0;
      break;
    }
  }
  if (flag) {
    cout << "pairwise coprime\n";
    return;
  }
  int GG = 0;
  for (int i = 0; i < n; i++) {
    GG = gcd(GG, A[i]);
  }
  if (GG == 1) {
    cout << "setwise coprime\n";
  } else {
    cout << "not coprime\n";
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  sieve(1000002);
  solve();
  return 0;
}
