#include <bits/stdc++.h>
using namespace std;

// template {{{
#define  range(i, l, r) for (int i = (int)(l); i < (int)(r); (i) += 1)
#define rrange(i, l, r) for (int i = (int)(r) - 1; i >= (int)(l); (i) -= 1)

#define  whole(f, x, ...) ([&](decltype((x)) container) { return (f)(  begin(container),  end(container), ## __VA_ARGS__); })(x)
#define rwhole(f, x, ...) ([&](decltype((x)) container) { return (f)( rbegin(container), rend(container), ## __VA_ARGS__); })(x)

#define debug(x) cerr << "(" << __LINE__ << ")" << #x << ": " << (x) << endl

using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;

// constexpr i32 mod   = 998244353;
constexpr i32 mod   = 1e9 + 7;
constexpr i32 inf   = 1001001001;
constexpr i64 infll = 1001001001001001001ll;

constexpr int dx[] = {0, -1, 1, 0, -1, 1, -1, 1};
constexpr int dy[] = {-1, 0, 0, 1, -1, -1, 1, 1};

struct IoSetup { IoSetup(int x = 15){ cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(x); cerr << fixed << setprecision(x); } } iosetup;

template <typename T = i64> T input() { T x; cin >> x; return x; }

template <typename T> ostream &operator<<(ostream &os, vector<T> &v) { range(i, 0, v.size()) { os << v[i] << (i + 1 != v.size() ? " " : ""); } return os; }
template <typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &in : v) is >> in; return is; }

template <typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
template <typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; }

template <typename T> vector<T> make_vector(size_t a, T b) { return vector<T>(a, b); }
template <typename... Ts> auto make_vector(size_t a, Ts... ts) { return vector<decltype(make_vector(ts...))>(a, make_vector(ts...)); }

template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
// }}}

// eratosthenes {{{
std::vector< bool > sieve_of_eratosthenes(uint_fast32_t n) {
    std::vector< bool > prime_table(n + 1, true);
    if (n >= 1) prime_table[0] = prime_table[1] = false;

    for (int_fast64_t p = 2; p * p <= n; ++p) {
        if (!prime_table[p]) continue;
        for (int_fast64_t q = p * p; q <= n; q += p) {
            prime_table[q] = false;
        }
    }

    return prime_table;
}
// }}}

void solver() {
    int n = input();

    auto bs = sieve_of_eratosthenes(1000);
    vector< int > ps;
    range(i, 0, bs.size()) if (bs[i]) ps.push_back(i);

    vector< int > as(n);
    cin >> as;

    int gs = as[0];
    for (auto &a: as) gs = __gcd(gs, a);

    set< int > st;
    whole(reverse, as);

    bool pc = true;
    for (auto &a: as) {
        vector< int > fac;
        for (auto &p: ps) {
            if (a % p == 0) fac.push_back(p);
            while (a % p == 0) {
                a /= p;
            }
        }

        if (a != 1) fac.push_back(a);

        bool f = true;
        for (auto fa: fac) {
            if (st.count(fa) != 0) {
                f = false;
                continue;
            }

            st.insert(fa);
        }

        pc = (pc && f);
    }

    if (pc) {
        cout << "pairwise coprime" << endl;
    } else if (gs == 1) {
        cout << "setwise coprime" << endl;
    } else {
        cout << "not coprime" << endl;
    }
}

signed main(int argc, char *argv[]) {
    solver();
}


Measured memory_bytes: 10816