#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
  if (a <= b) {
    swap(a, b);
  }
  if (b == 0) {
    return a;
  } else {
    return gcd(b, a % b);
  }
}
int main() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  int gc = gcd(a[0], a[1]);
  for (int i = 2; i < n; i++) {
    gc = gcd(gc, a[i]);
  }
  if (gc != 1) {
    cout << "not coprime" << endl;
    return 0;
  }
  set<int> s;
  for (int i = 0; i < n; i++) {
    s.insert(a[i]);
    for (int j = 2; j * j <= a[i]; j++) {
      if (a[i] % j == 0) {
        if (s.find(j) != s.end() || s.find(a[i] / j) != s.end()) {
          cout << "setwise coprime" << endl;
          return 0;
        }
        s.insert(j);
        s.insert(a[i] / j);
      }
    }
  }
  cout << "pairwise coprime" << endl;
  return 0;
}
