#include <bits/stdc++.h>
using namespace std;

const int MAX = 510000;
const int MOD = 1000000007;

long long fac[MAX], finv[MAX], inv[MAX];

// テーブルを作る前処理
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}

// 二項係数計算
long long COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}

int main() {
  COMinit();
  long long int N;
  cin >> N;
  vector<long long int> A(N);
  for (int i = 0; i < N; i++) cin >> A.at(i);
  long long int G = A.at(0), S = 1, L = 1, MOD = 1000000007;
  for (int i = 0; i < N; i++) {
    G = __gcd(G, A.at(i));
    S = (S * A.at(i)) % MOD;
    L = (L * A.at(i) % MOD * inv[__gcd(L, A.at(i))]) % MOD;
  }
  if (G == 1 && S == L) cout << "pairwise coprime" << endl;
  else if (G == 1) cout << "setwise coprime" << endl;
  else cout << "not coprime" << endl;
}
