#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18 + 5;
const long long mod = 1e9 + 7;
const long long N = 2e5 + 314;
const long double pi = 3.1415926535897932384626433832795;
long long gcd(long long x, long long y) { return (x == 0 ? y : gcd(y % x, x)); }
void solve() {
  long long n;
  cin >> n;
  vector<long long> v(n);
  map<long long, long long> u;
  long long gc = 0;
  for (long long i = 0; i < n; i++) {
    cin >> v[i];
    for (long long j = 1; j <= sqrt(v[i]); j++) {
      if (v[i] % j == 0) {
        u[j]++;
        if (j * j != v[i]) u[v[i] / j]++;
      }
    }
    gc = gcd(gc, v[i]);
  }
  if (gc > 1)
    cout << "not coprime";
  else {
    for (auto i : u) {
      if (i.first > 1 && i.second > 1) {
        cout << "setwise coprime";
        return;
      }
    }
    cout << "pairwise coprime";
  }
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long t = 1;
  while (t--) solve();
}
