#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
const long long l_INF = 1010101010101010;
const int INF = 1010101010;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
using vi = vector<int>;
using vll = vector<long long>;
using vvi = vector<vi>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
int main() {
  int n;
  cin >> n;
  map<int, int> insu;
  vi a(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < n; i++) {
    int x = a[i];
    for (int j = 2; j <= sqrt(x); j++) {
      if (x % j == 0) insu[j]++;
      while (x % j == 0) {
        x /= j;
      }
    }
    if (x > 1) insu[x]++;
  }
  bool judge0 = true, judge1 = false;
  for (auto x : insu) {
    if (x.second > 1) judge0 = false;
  }
  if (judge0) {
    cout << "pairwise conprime" << endl;
    return 0;
  }
  for (auto x : insu) {
    if (x.second == n) judge1 = true;
  }
  if (judge1) {
    cout << "not conprime" << endl;
    return 0;
  }
  cout << "setwise coprime" << endl;
}
