#include <bits/stdc++.h>
using ll = long long int;
const int INF = (1 << 30);
const ll INFLL = (1ll << 60);
const ll MOD = (ll)(1e9 + 7);
void mul_mod(ll& a, ll b) {
  a *= b;
  a %= MOD;
}
void add_mod(ll& a, ll b) {
  a = (a < MOD) ? a : (a - MOD);
  b = (b < MOD) ? b : (b - MOD);
  a += b;
  a = (a < MOD) ? a : (a - MOD);
}
int cnt[1001001];
int main(void) {
  int n, i, j, a;
  bool flag = true;
  std::cin >> n;
  for (i = 0; i < n; ++i) {
    std::cin >> a;
    ++cnt[a];
  }
  for (i = 2; i <= 1000000; ++i) {
    a = 0;
    for (j = i; j <= 1000000; j += i) {
      a += cnt[j];
    }
    if (a == n) {
      std::cout << "not coprime" << std::endl;
      return 0;
    }
    if (a > 1) {
      flag = false;
      break;
    }
  }
  std::cout << (flag ? "pair" : "set") << "wise coprime" << std::endl;
  return 0;
}
