#include <bits/stdc++.h>
using namespace std;
template <typename T>
T ii() {
  T a;
  cin >> a;
  return a;
}
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);
  }
};
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
bool factors(int n, unordered_map<int, int, custom_hash> &map) {
  int i = 2;
  while (i * i < n) {
    if (n % i == 0) {
      ++map[i];
      if (i * i != n) ++map[n / i];
      if (map[i] > 1 || map[n / i] > 1) return false;
    }
    ++i;
  }
  ++map[n];
  if (map[n] > 1) return false;
  return true;
}
int main(void) {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  vector<int> ar(n);
  for (auto &it : ar) cin >> it;
  int g = 0;
  bool isPairwise = true;
  unordered_map<int, int, custom_hash> map;
  for (auto &it : ar) g = gcd(g, it);
  for (auto &it : ar) {
    isPairwise &= factors(it, map);
    if (!isPairwise) break;
  }
  if (isPairwise)
    cout << ("pairwise coprime") << "\n";
  else if (g == 1)
    cout << ("setwise coprime") << "\n";
  else
    cout << ("not coprime") << "\n";
  return 0;
}
