#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using db = double;
using ld = long double;
template <typename T>
using V = vector<T>;
template <typename T>
using VV = vector<vector<T>>;
constexpr ll mod = 1000000007;
constexpr ll INF = 1000000099;
constexpr ll LINF = (ll)(1e18 + 99);
const ld PI = acos((ld)-1);
const vector<ll> dx = {-1, 1, 0, 0}, dy = {0, 0, -1, 1};
template <typename T, typename U>
inline bool chmin(T& t, const U& u) {
  if (t > u) {
    t = u;
    return 1;
  }
  return 0;
}
template <typename T, typename U>
inline bool chmax(T& t, const U& u) {
  if (t < u) {
    t = u;
    return 1;
  }
  return 0;
}
template <typename T>
inline T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <typename T, typename Y>
inline T mpow(T a, Y n) {
  T res = 1;
  for (; n; n >>= 1) {
    if (n & 1) res = res * a;
    a = a * a;
  }
  return res;
}
template <typename T, typename Y>
ostream& operator<<(ostream& os, const pair<T, Y>& p) {
  return os << "{" << p.first << "," << p.second << "}";
}
template <typename T>
ostream& operator<<(ostream& os, const V<T>& v) {
  os << "{";
  for (auto e : v) os << e << ",";
  return os << "}";
}
template <typename... Args>
void debug(Args&... args) {
  for (auto const& x : {args...}) {
    cerr << x << ' ';
  }
  cerr << '\n';
}
template <typename T>
vector<T> get_prime_factor(T x) {
  vector<T> res(0);
  for (ll i = 2; i * i <= x; i++) {
    if (x % i == 0) res.push_back(i);
    while (x % i == 0) {
      x /= i;
    }
  }
  if (x != 1) res.push_back(x);
  return res;
}
signed main() {
  cin.tie(0);
  cerr.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);
  ll n;
  cin >> n;
  V<ll> v(n);
  for (ll i = 0; i < (ll)(n); ++i) cin >> v[i];
  ll g = v[0];
  for (ll i = 1; i < (ll)(n); ++i) g = gcd(g, v[i]);
  bool pc = true;
  set<int> se;
  for (ll i = 0; i < (ll)(n); ++i) {
    V<ll> ps = get_prime_factor(v[i]);
    for (ll j = 0; j < (ll)((ll)(ps).size()); ++j) {
      if (se.count(ps[j]))
        pc = false;
      else
        se.insert(ps[j]);
    }
  }
  if (pc)
    cout << "pairwise coprime" << '\n';
  else if (g == 1)
    cout << "setwise coprime" << '\n';
  else
    cout << "not coprime" << '\n';
}
