#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<long long, long long>;
long long dx[] = {1, 0, -1, 0};
long long dy[] = {0, 1, 0, -1};
constexpr ll mod = 1e9 + 7;
constexpr ll inf = INT32_MAX / 2;
constexpr ll INF = LLONG_MAX / 2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
ll fact(long long i) {
  if (i == 0) return 1;
  return (fact(i - 1)) * i % mod;
}
ll gcd(ll a, ll b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
long long keta(ll n) {
  if (n == 0) return 1;
  long long count = 0;
  while (n != 0) {
    n /= 10;
    count++;
  }
  return count;
}
ll ketasum(ll n) {
  ll sum = 0;
  while (n != 0) {
    sum += n % 10;
    n /= 10;
  }
  return sum;
}
bool isprime(long long n) {
  if (n == 1) return false;
  if (n == 2) return true;
  for (long long i = 2; i <= sqrt(n); i++) {
    if (n % i == 0) return false;
  }
  return true;
}
signed main() {
  long long n;
  cin >> n;
  vector<long long> a(n);
  long long g;
  set<long long> st;
  bool ok = true;
  for (long long i = 0; i < (long long)(n); i++) {
    cin >> a[i];
    if (i == 0)
      g = a[i];
    else
      g = gcd(g, a[i]);
    if (st.count(a[i])) ok = false;
    queue<long long> que;
    for (long long j = 2; j <= sqrt(a[i]); j++)
      if (a[i] % j == 0) que.push(j), que.push(a[i] / j);
    while (!que.empty()) {
      long long p = que.front();
      que.pop();
      for (long long j = p; j <= 100000; j += p) st.insert(j);
    }
  }
  if (ok && g == 1)
    cout << "pairwise coprime\n";
  else if (g == 1)
    cout << "setwise coprime\n";
  else
    cout << "not coprime\n";
  return 0;
}
