#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define get_unique(x) x.erase(unique(all(x)), x.end());
typedef long long ll;
typedef complex<double> Complex;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
const ll LINF = 1e18;
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T& a, const T& b) {
    if (b < a) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
vector<T> make_vec(size_t a) {
    return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
    return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template <typename T>
ostream& operator<<(ostream& os, vector<T> v) {
    for (int i = 0; i < sz(v); i++) {
        os << v[i];
        if (i < sz(v) - 1) os << " ";
    }
    return os;
}
int main() {
    int n;
    cin >> n;
    vector<int> a(n);
    int g = 0;
    rep(i, n) cin >> a[i], g = gcd(g, a[i]);

    vector<int> min_factor(1001001, -1);
    for (int i = 2; i <= 1000000; i++) {
        if (~min_factor[i]) continue;
        for (int d = i; d <= 1000000; d += i) {
            if (min_factor[d] == -1) min_factor[d] = i;
        }
    }

    vector<int> cnt(1001001);
    for (int x : a) {
        for (int d = min_factor[x]; d > 1; d /= min_factor[x]) {
            cnt[d]++;
        }
    }
    if (*max_element(all(cnt)) <= 1)
        cout << "pairwise coprime" << endl;
    else if (g == 1)
        cout << "setwise coprime" << endl;
    else
        cout << "not coprime" << endl;
}