#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}
template <typename A>
string to_string(A v) {
  if (v.size() >= 200) {
    return "Too big container";
  }
  bool first = true;
  string res = "{";
  for (const auto& x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
template <typename T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
const long long MOD = 1e9 + 7;
const int INFI = (1 << 30) - 1;
const long long INFLL = (1LL << 62) - 1;
template <typename T>
void printv(vector<T>& v) {
  int n = v.size() - 1;
  for (int i = 0; i < n; ++i) cout << v[i] << " ";
  cout << v.back() << endl;
}
const int dy[4] = {0, 1, 0, -1};
const int dx[4] = {1, 0, -1, 0};
const int dy8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dx8[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
double deg2rad(double deg) { return deg * M_PI / 180; }
double rad2deg(double rad) { return rad * 180 / M_PI; }
void yesorno(bool flag) {
  if (flag)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
  ;
}
vector<bool> prime_table(long long n) {
  vector<bool> isPrime(n + 1, true);
  isPrime[0] = false;
  isPrime[1] = false;
  for (int i = 2; i <= n; ++i) {
    if (!isPrime[i]) continue;
    isPrime[i] = true;
    for (int j = i * 2; j <= n; j += i) {
      isPrime[j] = false;
    }
  }
  return isPrime;
}
int gcd(int a, int b) {
  if (b > a) swap(a, b);
  if (a % b == 0) return b;
  return gcd(b, a % b);
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int N;
  cin >> N;
  auto pt = prime_table(1000000);
  vector<int> A(N);
  for (int i = 0; i < N; ++i) cin >> A[i];
  sort(begin(A), end(A));
  int curgcd;
  unordered_set<int> primes;
  bool dupPrime = 0;
  auto primeFactorize = [&](int val) {
    for (int a = 2; a * a <= val; ++a) {
      if (val % a != 0) continue;
      while (val % a == 0) {
        val /= a;
      }
      bool dup = !primes.insert(a).second;
      if (dup) {
        dupPrime = 1;
        break;
      }
    }
  };
  for (int i = 0; i < N; ++i) {
    int a = A[i];
    if (!dupPrime) {
      primeFactorize(a);
    }
    if (i) {
      curgcd = gcd(curgcd, a);
    } else {
      curgcd = a;
    }
  }
  if (!dupPrime) {
    cout << "pairwise coprime" << endl;
    ;
  } else if (curgcd == 1) {
    cout << "setwise coprime" << endl;
    ;
  } else {
    cout << "not coprime" << endl;
    ;
  }
}
