#include <bits/stdc++.h>
using namespace std;
priority_queue<long long int, vector<long long int>, greater<long long int> >
    ti;
vector<long long int> p[200005], a(300005), b(1000005, 0), f(500005, 0);
long long int vis[200005];
map<pair<long long int, long long int>, long long int> mp;
set<pair<long long int, long long int> > s;
set<long long int> st;
map<long long int, long long int> np, v;
queue<long long int> qy;
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int bpow(long long int a, long long int b) {
  long long int res = 1;
  while (b > 0) {
    if (b & 1) res = (res * a) % 1000000007;
    a = (a * a) % 1000000007;
    b >>= 1;
  }
  return res % 1000000007;
}
void fact(long long int i) {
  f[0] = 1;
  for (long long int k = 1; k <= i; k++) {
    f[k] = (f[k - 1] * k) % 1000000007;
  }
}
long long int isprime(long long int n) {
  if (n == 1) return 0;
  for (long long int i = 2; i <= sqrt(n); i++)
    if (n % i == 0) return 0;
  return 1;
}
bool cmp(long long int i, long long int j) { return p[i].size() < p[j].size(); }
long long int comb(long long int n, long long int i) {
  long long int g =
      f[n] * (bpow(f[i], 1000000007 - 2)) * bpow(f[n - i], 1000000007 - 2);
  return g % 1000000007;
}
long long int permute(long long int n, long long int i) {
  long long int h = f[n - i];
  long long int g = f[n] * (bpow(h, 1000000007 - 2));
  return g % 1000000007;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int n;
  cin >> n;
  long long int x;
  for (long long int i = 0; i < n; i++) {
    cin >> x;
    for (long long int j = 2; j <= sqrt(x); j++) {
      if (x % j == 0) {
        b[j]++;
        while (x % j == 0) {
          x /= j;
        }
      }
      if (x > 1) {
        b[x]++;
      }
    }
  }
  long long int f = 0;
  for (long long int i = 2; i < 1000001; i++) {
    if (b[i] > 1 && f < 1) {
      f = 1;
    }
    if (b[i] == n) {
      f = 2;
    }
  }
  if (f == 2) {
    cout << "not coprime"
         << "\n";
  }
  if (f == 1) {
    cout << "setwise coprime"
         << "\n";
  }
  if (f == 0) {
    cout << "pairwise coprime"
         << "\n";
  }
}
