#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1e9;
int main() {
  int n;
  const int max_n = 1e6;
  int a[max_n + 1];
  int max_a = 0;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    max_a = max(max_a, a[i]);
  }
  vector<int> d(max_a + 1, 0);
  d[0] = d[1] = 1;
  for (int i = 2; i <= max_a; i++) {
    int j = i;
    while (j <= max_a) {
      if (d[j] == 0) d[j] = i;
      j += i;
    }
  }
  vector<int> cnt(max_a + 1, 0);
  bool flag1 = 0;
  bool flag2 = 0;
  int prime = 2;
  for (int i = 0; i < n; i++) {
    int tmp = a[i];
    while (tmp > 1) {
      prime = d[tmp];
      cnt[prime]++;
      while (tmp % prime == 0) tmp /= prime;
      if (cnt[prime] > 1) flag1 = 1;
      if (cnt[prime] == n) flag2 = 1;
    }
  }
  string ans = "not copriime";
  if (flag2 == 0) ans = "setwise coprime";
  if (flag1 == 0) ans = "pairwise coprime";
  cout << ans << endl;
  return 0;
}
