#include <bits/stdc++.h>
using namespace std;
const int N = 2e6 + 5;
vector<long long int> sieve;
vector<long long int> *Sieve(int n) {
  const long long int maxn = n;
  sieve.resize(maxn);
  for (long long int(i) = 0; (i) < (maxn); ++(i)) sieve[i] = 1;
  sieve[1] = 0;
  sieve[0] = 0;
  for (long long int(i) = 2; (i) <= (maxn); (i) += (1))
    if (1 == sieve[i])
      for (long long int j = i * i; j < maxn; j += i) sieve[j] = 0;
  vector<long long int> *primes = new vector<long long int>();
  primes->push_back(2);
  for (int i = 3; i < maxn; i += 2)
    if (sieve[i]) {
      primes->push_back(i);
    }
  return primes;
}
long long int extended_GCD(long long int a, long long int b, long long int &x,
                           long long int &y) {
  if (a == 0) {
    x = 0;
    y = 1;
    return b;
  }
  long long int x1, y1;
  long long int gcd = extended_GCD(b % a, a, x1, y1);
  x = y1 - (b / a) * x1;
  y = x1;
  return gcd;
}
long long int ncr(long long int n, long long int k) {
  long long int r = 1;
  if (k > n - k) k = n - k;
  for (long long int i = 0; i < k; i++) {
    r *= (n - i);
    r /= (i + 1);
  }
  return r;
}
long long int power(long long int a, long long int b,
                    long long int m = 1000000007) {
  long long int res = 1;
  while (b > 0) {
    if (b & 1) res = (res * a) % m;
    a = (a * a) % m;
    b >>= 1;
  }
  return res;
}
long long int modinv(long long int a, long long int mod = 1000000007) {
  long long int x, y;
  extended_GCD(a, mod, x, y);
  if (x < 0) x += mod;
  return x;
}
bool prime(int n) {
  int c = 0;
  for (int i = 2; (i * i) <= n; i++) {
    if (n % i == 0) {
      c++;
      return false;
    }
  }
  if (c == 0) return true;
}
int occ[N];
int a[N];
void solve() {
  int n;
  cin >> n;
  for (long long int(i) = 0; (i) < (n); ++(i)) {
    cin >> a[i];
  }
  bool ok = true;
  for (int i = 0; i < n; i++) {
    int x = a[i];
    for (int j = 2; j * j <= x; j++) {
      if (x % j == 0) {
        occ[j]++;
        if (occ[j] > 1) ok = false;
        while (x % j == 0) x /= j;
      }
      if (x != 1) occ[x]++;
      if (occ[x] > 1) ok = false;
    }
  }
  if (ok) {
    cout << "pairwise coprime"
         << "\n";
    return;
  } else {
    for (long long int(i) = 1; (i) <= (1000000); ++(i)) {
      if (occ[i] == n) {
        cout << "not coprime\n";
        return;
      }
    }
    cout << "setwise coprime\n";
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
  return 0;
}
