#include <bits/stdc++.h>
using namespace std;
const long long INF = 100000000;
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
map<long long, long long> m;
long long cnt = 0, n, a;
void prime_factorize(long long N) {
  bool flag = true;
  for (long long a = 2; a * a <= N; ++a) {
    if (N % a != 0) continue;
    long long ex = 0;
    while (N % a == 0) {
      ++ex;
      N /= a;
    }
    if (m[a] != 0) flag = false;
    m[a]++;
  }
  if (flag) cnt++;
}
int main() {
  cin >> n;
  vector<long long> a(n);
  cnt = 0;
  for (long long i = 0; i < (n); i++) {
    cin >> a[i];
    prime_factorize(a[i]);
  }
  cout << "setwise coprime" << endl;
}
