#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
long long mod2 = 998244353;
long long mod3 = 1000003;
long long mod4 = 998244853;
long long mod5 = 1000000009;
long long inf = 1LL << 61;
int iinf = 1 << 30;
double pi = 3.14159265358979323846;
double pi2 = pi / 2.0;
double eps = 1e-8;
int dh[4] = {1, 0, -1, 0};
int dw[4] = {0, 1, 0, -1};
int ddh[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
int ddw[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
struct custom_hash {
  static uint64_t splitmix64(uint64_t x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
long long gcd(long long a, long long b) {
  if (a < 0) a = -a;
  if (b < 0) b = -b;
  if (a < b) swap(a, b);
  if (b == 0) return a;
  if (a % b == 0) return b;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
  long long c = gcd(a, b);
  return a * b / c;
}
long long Pow(long long n, long long k) {
  if (k < 0) return 0;
  long long ret = 1;
  long long now = n;
  while (k > 0) {
    if (k & 1) ret *= now;
    now *= now;
    k /= 2;
  }
  return ret;
}
long long beki(long long n, long long k, long long md) {
  long long ret = 1;
  long long now = n;
  now %= md;
  while (k > 0) {
    if (k % 2 == 1) {
      ret *= now;
      ret %= md;
    }
    now *= now;
    now %= md;
    k /= 2;
  }
  return ret;
}
long long gyaku(long long n, long long md) { return beki(n, md - 2, md); }
long long popcount(long long n) {
  long long ret = 0;
  long long u = n;
  while (u > 0) {
    ret += u % 2;
    u /= 2;
  }
  return ret;
}
struct UF {
 private:
  vector<int> par, len, you;

 public:
  UF(int n) {
    for (int i = 0; i < n; i++) {
      par.push_back(i);
      len.push_back(0);
      you.push_back(1);
    }
  }
  int root(int n) {
    if (par[n] == n)
      return n;
    else
      return par[n] = root(par[n]);
  }
  void unit(int a, int b) {
    a = root(a);
    b = root(b);
    if (a == b) return;
    if (len[a] < len[b]) {
      par[a] = b;
      you[b] += you[a];
    } else {
      par[b] = a;
      you[a] += you[b];
      if (len[a] == len[b]) len[a]++;
    }
  }
  int yo(int a) {
    a = root(a);
    return you[a];
  }
};
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  long long a[n];
  long long se = 0;
  map<long long, long long> mp;
  vector<long long> pri;
  bool used[1000001];
  fill(used, used + 1000001, false);
  for (int i = 2; i < 1000001; i++) {
    if (used[i]) continue;
    pri.push_back(i);
    for (int j = 2 * i; j <= 1000000; j += i) used[j] = true;
  }
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    se = gcd(se, a[i]);
  }
  if (se != 1) {
    cout << "not coprime" << endl;
    return 0;
  }
  for (int i = 0; i < n; i++) {
    if (used[a[i]] == false) {
      mp[a[i]]++;
      if (mp[a[i]] == 2) {
        cout << "setwise coprime" << endl;
        return 0;
      }
      continue;
    }
    for (int j = 0; j < pri.size(); j++) {
      if (a[i] % pri[j] == 0) {
        while (a[i] % pri[j] == 0) a[i] /= pri[j];
        mp[pri[j]]++;
        if (mp[pri[j]] == 2) {
          cout << "setwise coprime" << endl;
          return 0;
        }
      }
      if (used[a[i]] == false) break;
    }
    if (a[i] != 1) {
      mp[a[i]]++;
      if (mp[a[i]] == 2) {
        cout << "setwise coprime" << endl;
        return 0;
      }
    }
  }
  cout << "pairwise coprime" << endl;
}
