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

int main() {
  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) / __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;
}