#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vs = vector<string>;
using vc = vector<char>;
using vd = vector<double>;
using vvd = vector<vector<double>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vvp = vector<vector<pair<int, int>>>;
template <typename T>
using ve = vector<T>;
template <typename T>
using pq2 = priority_queue<T>;
template <typename T>
using pq1 = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T>
bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T>
T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <typename T>
T lcm(T a, T b) {
  return a * b / gcd(a, b);
}
template <typename T>
T extgcd(T a, T b, T& x, T& y) {
  T d = a;
  if (b != 0) {
    d = extgcd(b, a % b, y, x);
    y -= (a / b) * x;
  } else
    x = 1, y = 0;
  return d;
}
template <typename T>
T modpow(T x, T n, T m) {
  if (n == 0) return 1;
  T resp = modpow(x * x % m, n / 2, m);
  if (n & 1) resp = resp * x % m;
  return resp;
}
template <typename T>
T modinverse(T a, T m) {
  T x, y;
  extgcd(a, m, x, y);
  return (m + x % m) % m;
}
struct combination {
  ll M = 1000000007;
  vector<ll> fact, ifact;
  combination(ll n) : fact(n + 1), ifact(n + 1) {
    fact[0] = 1;
    ifact[0] = 1;
    for (ll i = 0; i < n; i++) {
      fact[i + 1] = fact[i] * (i + 1) % M;
      ifact[i + 1] = ifact[i] * modpow(i + 1, M - 2, M) % M;
    }
  }
  ll com(ll a, ll b) {
    if (a == 0 && b == 0) return 1;
    if (a < b || a < 0) return 0;
    ll tmp = ifact[a - b] * ifact[b] % M;
    return tmp * fact[a] % M;
  }
};
struct prime {
  vector<int> f, prime_list;
  prime(int n = 1) : f(n + 1) {
    f[0] = f[1] = -1;
    for (ll i = 2; i <= n; ++i) {
      if (f[i]) continue;
      f[i] = i;
      prime_list.push_back(i);
      for (ll j = i * i; j <= n; j += i) {
        if (!f[j]) f[j] = i;
      }
    }
  }
  bool is_prime(int a) { return f[a] == a; }
  vector<int> ve_prime(int a) {
    vector<int> res;
    while (a != 1) {
      res.push_back(f[a]);
      a /= f[a];
    }
    return res;
  }
  vector<pair<int, int>> num_prime(int a) {
    vector<int> flist = ve_prime(a);
    if (flist.size() == 0) return {};
    vector<pii> res(1, {flist[0], 0});
    for (int p : flist) {
      if (res.back().first == p)
        res.back().second++;
      else
        res.push_back({p, 1});
    }
    return res;
  }
};
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int N;
  cin >> N;
  vi A(N);
  for (int i = 0; i < (N); i++) {
    cin >> A[i];
  };
  prime P(1000010);
  map<int, int> M;
  int ans = 0;
  for (int i = 0; i < (N); i++) {
    ve<pii> aa = P.num_prime(A[i]);
    for (int j = 0; j < (int(aa.size())); j++) M[aa[i].first] += aa[i].second;
  }
  for (int i = 0; i < (N); i++) {
    if (ans != 0) break;
    ve<pii> aa = P.num_prime(A[i]);
    for (int j = 0; j < (int(aa.size())); j++) {
      if (M[aa[i].first] != aa[i].second) {
        ans = 1;
        break;
      }
    }
  }
  if (ans == 0) {
    cout << "pairwise coprime" << endl;
  } else {
    int bb = A[0];
    for (int i = (1); i < (N); i++) bb = gcd(bb, A[i]);
    if (bb == 1) {
      cout << "setwise coprime" << endl;
    } else {
      cout << "not coprime" << endl;
    }
  }
  return 0;
}
