#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename T>
void print_vec(const vector<T>& v, bool is_reverse = false, ll num = 0) {
  if (num == 0) num = (ll)v.size();
  cout << endl;
  cout << "i=  ";
  for (ll i = 0; i < num; i++) cout << i << "   ";
  cout << endl;
  cout << "    ";
  if (is_reverse)
    for (ll i = num - 1; i >= 0; i--) {
      cout << v[i];
      if (i != 0) cout << "   ";
    }
  else
    for (ll i = 0; i < num; i++) {
      cout << v[i];
      if (i != num - 1) cout << "   ";
    }
  cout << endl;
}
template <typename T>
void print_pairvec(const vector<T>& v, ll num = 0) {
  if (num == 0) num = (ll)v.size();
  cout << endl;
  for (ll i = 0; i < num; i++) {
    cout << v[i].first << " " << v[i].second << endl;
  }
}
template <typename T>
void print_vec2(const vector<vector<T>>& v) {
  cout << endl;
  cout << "       ";
  for (ll i = 0; i < v[0].size(); i++) cout << i << "   ";
  cout << endl;
  for (ll i = 0; i < v.size(); i++) {
    cout << "i=" << i << ":   ";
    for (ll j = 0; j < v[i].size(); j++) {
      if (v[i][j] == 0)
        cout << "\x1B[0m" << v[i][j] << "   ";
      else
        cout << "\x1B[31m" << v[i][j] << "   ";
    }
    cout << "\x1B[0m" << endl;
  }
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
  ll N;
  cin >> N;
  vector<ll> A(N);
  for (int i = 0; i < N; i++) cin >> A[i];
  sort(A.begin(), A.end());
  string ans = "not coprime";
  int g = gcd(A[0], A[1]);
  for (int i = 2; i < N; i++) {
    g = gcd(g, A[i]);
  }
  if (g != 1) {
    cout << ans << endl;
    return 0;
  }
  ans = "setwise coprime";
  for (int i = 0; i < N - 1; i++) {
    if (gcd(A[i], A[i + 1]) != 1) {
      cout << ans << endl;
      return 0;
    }
  }
  cout << "pairwise coprime" << endl;
}
