#include <bits/stdc++.h>
using namespace std;
int MOD = 1e9 + 7;
long long int power(long long int a, long long int b) {
  long long int res = 1;
  a = a % MOD;
  while (b > 0) {
    if (b & 1) {
      res = (res * a) % MOD;
      b--;
    }
    a = (a * a) % MOD;
    b >>= 1;
  }
  return res;
}
long long int fermat_inv(long long int y) { return power(y, MOD - 2); }
long long int gcd(long long int a, long long int b) {
  return (b == 0) ? a : gcd(b, a % b);
}
long long int min(long long int a, long long int b) { return (a > b) ? b : a; }
long long int max(long long int a, long long int b) { return (a > b) ? a : b; }
bool prime[1000001];
vector<int> primes;
void SieveOfEratosthenes(int n) {
  memset(prime, true, sizeof(prime));
  for (int p = 2; p * p <= n; p++) {
    if (prime[p] == true) {
      for (int i = p * p; i <= n; i += p) prime[i] = false;
    }
  }
  for (int p = 2; p < 1000001; p++)
    if (prime[p]) primes.push_back(p);
}
int freq[1000005];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t = 1;
  SieveOfEratosthenes(1000000);
  while (t--) {
    int n;
    cin >> n;
    int a[n];
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < n; i++) {
      int temp = a[i];
      for (int j : primes) {
        if (j > temp) break;
        if (temp % j == 0) {
          freq[j]++;
          while (temp % j == 0) temp /= j;
        }
      }
    }
    bool cp = true, cs = true;
    for (int i = 0; i <= 1000000; i++) {
      if (freq[i] > 1) cp = false;
      if (freq[i] == n) cs = false;
    }
    if (cp)
      cout << "pairwise coprime";
    else if (cs)
      cout << "setwise coprime";
    else
      cout << "not coprime";
  }
}
