#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
long long gcd(long long a, long long b) { return (!b ? a : gcd(b, a % b)); }
long long lcm(long long a, long long b) { return ((a * b) / gcd(a, b)); }
bool cmp(int a, int b) { return a > b; }
const long long mod = 1e9 + 7;
const int INF32 = 1 << 30;
const long long INF64 = 1LL << 60;
const long double pi = 3.141592653589793;
long long modpow(long long n, long long k, long long mod) {
  if (k == 0) return 1;
  long long r = modpow(n * n % mod, k >> 1, mod);
  if (k & 1) r = r * n % mod;
  return r;
}
void solve() {
  int n;
  cin >> n;
  vector<int> a(n);
  vector<int> sus;
  for (int i = 0; i < n; i++) cin >> a[i];
  int c = a[0];
  int prec = a[0];
  for (int i = 1; i < n; i++) {
    c = gcd(c, a[i]);
    if (c < prec) {
      prec = c;
      sus.push_back(a[i]);
    }
    if (c == 1) {
      break;
    }
  }
  if (c != 1) {
    cout << "not" << ' ' << "coprime";
    return;
  }
  sus.push_back(a[0]);
  int cnt = 0;
  for (int i = 0; i < sus.size(); i++) {
    for (int j = i + 1; j < sus.size(); j++) {
      if (gcd(sus[i], sus[j]) == 1) {
        cout << "pairwise" << ' ' << "coprime";
        return;
      }
    }
  }
  cout << "setwise" << ' ' << "coprime";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  solve();
  return 0;
}
