#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int gcd(int a, int b) {
  if (a % b == 0) {
    return (b);
  } else {
    return (gcd(b, a % b));
  }
}
const int K = 100005;
int main() {
  int n;
  cin >> n;
  vector<int> a(n);
  vector<int> c(K);
  for (int i = 0; i < (n); ++i) {
    cin >> a[i];
    c[a[i]]++;
  }
  bool ok = true;
  for (int i = 2; i < K; ++i) {
    int cnt = 0;
    for (int j = i; j < K; j += i) {
      cnt += c[j];
    }
    if (cnt >= 2) ok = false;
  }
  if (ok) {
    cout << "pairwaise coprime";
    return 0;
  }
  int k = a[0];
  for (int i = 0; i < (n); ++i) {
    k = gcd(a[i], k);
  }
  if (k == 1)
    cout << "setwise copirme";
  else
    cout << "not coprime";
  return 0;
}
