#include <bits/stdc++.h>
using namespace std;
const int inf = 1000000007;
const long long INF = 1e18;
int mod = 1000000007;
const double eps = 1e-8;
template <typename T1, typename T2>
inline bool chmin(T1& a, T2 b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T1, typename T2>
inline bool chmax(T1& a, T2 b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
template <typename T, typename U>
T pow_(T a, U b) {
  return b ? pow_(a * a, b / 2) * (b % 2 ? a : 1) : 1;
}
long long modpow(long long a, long long b, long long _mod) {
  return b ? modpow(a * a % _mod, b / 2, _mod) * (b % 2 ? a : 1) % _mod : 1;
}
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
  os << p.first << " " << p.second;
  return os;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& vec) {
  for (int i = 0; i < ((int)vec.size()); ++i) {
    if (i) os << " ";
    os << vec[i];
  }
  return os;
}
template <class T>
ostream& operator<<(ostream& os, const set<T>& s) {
  for (auto si : s) os << si << " ";
  return os;
}
template <typename T>
inline istream& operator>>(istream& is, vector<T>& v) {
  for (int j = 0; j < ((int)v.size()); ++j) is >> v[j];
  return is;
}
template <class T, class T2>
inline void add(T& a, T2 b) {
  (a += (b % mod + mod)) %= mod;
}
template <class T>
void operator+=(vector<T>& v, vector<T> v2) {
  for (int i = 0; i < ((int)v2.size()); ++i) v.emplace_back(v2[i]);
}
void solve();
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cout << fixed << setprecision(12);
  int T;
  T = 1;
  while (T--) solve();
}
random_device rnd;
mt19937 mt(rnd());
uniform_int_distribution<> rand100(1, 10);
void solve() {
  int n;
  cin >> n;
  vector<int> a;
  int z = 0;
  for (int i = 0; i < (n); ++i) {
    int a_;
    cin >> a_;
    if (a_ == 1)
      ++z;
    else
      a.emplace_back(a_);
  }
  if (z == n) {
    cout << "pairwise coprime" << '\n';
    return;
  }
  int m = (int)a.size();
  int stc = a[0];
  for (int i = 0; i < (m); ++i) stc = gcd(stc, a[i]);
  if (z == 0 && stc != 1) {
    cout << "not coprime" << '\n';
    return;
  }
  map<int, int> mp;
  for (int i = 0; i < (m); ++i) {
    int a_ = a[i];
    for (int j = 2; j * j <= a[i]; ++j) {
      int cnt = 0;
      while (a_ % j == 0) {
        ++cnt;
        a_ /= j;
      }
      if (cnt && mp.count(j)) {
        cout << "setwise coprime" << '\n';
        return;
      }
      mp[j] = cnt;
    }
    if (a_ != 1 && mp.count(a_)) {
      cout << "setwise coprime" << '\n';
      return;
    }
    mp[a_] = 1;
  }
  cout << "pairwise coprime" << '\n';
}
