#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int A = 1000005;
int gcd(int a, int b) {
  int x = max(a, b);
  int y = min(a, b);
  int r = x % y;
  while (r != 0) {
    x = y;
    y = r;
    r = x % y;
  }
  return y;
}
int main() {
  int n;
  cin >> n;
  vector<int> a(n);
  vector<int> c(A);
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
    c[a[i]]++;
  }
  bool pairwise = true;
  for (int i = 2; i < A; i++) {
    int cnt = 0;
    for (int j = i; j < A; j += i) {
      cnt += c[j];
    }
    if (cnt > 1) pairwise = false;
    if (pairwise) {
      cout << "pairwise coprime" << endl;
      return 0;
    }
  }
  int g = a[0];
  for (int i = 0; i < n; ++i) {
    g = gcd(g, a[i]);
    if (g == 1) {
      cout << "setwise coprime" << endl;
      return 0;
    }
  }
  cout << "not coprime" << endl;
  return 0;
}
