#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
string Yes[2] = {"Yes", "No"};
long long gcd(long long A, long long B) {
  if (B == 0) return A;
  return gcd(B, A % B);
}
long long lcm(long long A, long long B) { return A * B / gcd(A, B); }
template <typename T>
T pow(T a, long long n, T e = 1) {
  T ret = e;
  while (n) {
    if (n & 1) ret *= a;
    a *= a;
    n >>= 1;
  }
  return ret;
}
template <int mod>
struct ModInt {
  int x;
  ModInt() : x(0) {}
  ModInt(long long x_) {
    if ((x = x_ % mod + mod) >= mod) x -= mod;
  }
  ModInt& operator+=(ModInt rhs) {
    if ((x += rhs.x) >= mod) x -= mod;
    return *this;
  }
  ModInt& operator-=(ModInt rhs) {
    if ((x -= rhs.x) < 0) x += mod;
    return *this;
  }
  ModInt& operator*=(ModInt rhs) {
    x = (unsigned long long)x * rhs.x % mod;
    return *this;
  }
  ModInt& operator/=(ModInt rhs) {
    x = (unsigned long long)x * rhs.inv().x % mod;
    return *this;
  }
  ModInt operator-() const { return -x < 0 ? mod - x : -x; }
  ModInt operator+(ModInt rhs) const { return ModInt(*this) += rhs; }
  ModInt operator-(ModInt rhs) const { return ModInt(*this) -= rhs; }
  ModInt operator*(ModInt rhs) const { return ModInt(*this) *= rhs; }
  ModInt operator/(ModInt rhs) const { return ModInt(*this) /= rhs; }
  bool operator==(ModInt rhs) const { return x == rhs.x; }
  bool operator!=(ModInt rhs) const { return x != rhs.x; }
  ModInt inv() const { return pow(*this, mod - 2); }
  friend ostream& operator<<(ostream& s, ModInt<mod> a) {
    s << a.x;
    return s;
  }
  friend istream& operator>>(istream& s, ModInt<mod>& a) {
    s >> a.x;
    return s;
  }
};
using mint = ModInt<1000000007>;
using Graph = vector<vector<int>>;
Graph G;
int MAX_N = 2e6;
vector<int> prime(MAX_N);
vector<bool> is_prime(MAX_N);
int sieve(int n) {
  int p = 0;
  for (int i = 0; i <= n; i++) is_prime[i] = true;
  is_prime[0] = is_prime[1] = false;
  for (int i = 2; i <= n; i++) {
    if (is_prime[i]) {
      prime[p++] = i;
      for (int j = 2 * i; j <= n; j += i) is_prime[j] = false;
    }
  }
  return p;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n;
  cin >> n;
  vector<int> a(n);
  int max_a = 0;
  for (long long int i = 0; i < n; i++) {
    cin >> a[i];
    max_a = max(a[i], max_a);
  }
  sieve(max_a);
  bool flag = true;
  for (long long int i = 0; i < n; i++) {
    if (is_prime[a[i]]) flag = false;
  }
  int GCD = a[0];
  for (long long int i = 0; i < n; i++) GCD = gcd(a[i], GCD);
  if (!flag)
    cout << "pairwise coprime" << endl;
  else if (GCD == 1)
    cout << "setwise coprime" << endl;
  else
    cout << "not coprime" << endl;
}
