#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
  int n;
  cin >> n;
  vector<int> a(n);
  set<int> s;
  for (int i = 0; i < n; i++) scanf("%d", &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;
  }
  for (int i = 0; i < n; i++) {
    if (a[i] == 1) continue;
    for (int j = 1; j * j <= a[i]; j++) {
      if (a[i] % j == 0) {
        if (j != 1 && (s.count(j) || s.count(a[i] / j))) {
          cout << "setwise coprime" << endl;
          return 0;
        }
        s.insert(j);
        s.insert(a[i] / j);
      }
    }
  }
  cout << "pairwise coprime" << endl;
  return 0;
}
