#include <bits/stdc++.h>
using namespace std;
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;
}

#ifdef DEBUG
void debug() { cerr << "\n"; }
template <class T> void debug(const T &x) { cerr << x << "\n"; }
template <class T, class... Args> void debug(const T &x, const Args &... args) {
    cerr << x << " ";
    debug(args...);
}
template <class T> void debugVector(const vector<T> &v) {
    for(const T &x : v) {
        cerr << x << " ";
    }
    cerr << "\n";
}
#else
template <class T, class... Args>
void debug(const T &x, const Args &... args) {}
template <class T> void debugVector(const vector<T> &v) {}
#endif

using ll = long long;
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
const double EPS = 1e-7;
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
constexpr int MOD = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

//-------------------------------------

struct FastFactorize {
    ll mul(ll a, ll b, ll c) { return (__int128)a * b % c; }
    ll power(ll a, ll b, ll mod) {
        ll res = 1;
        while(b) {
            if(b & 1) {
                res = mul(res, a, mod);
            }
            a = mul(a, a, mod);
            b >>= 1;
        }
        return res;
    }
    bool isPrime(ll n) {
        if(!(n & 1) && n != 2) {
            return false;
        }
        ll d = n - 1;
        int s = __builtin_ctzll(d);
        d >>= s;
        vector<int> A;
        if(n <= 1000000000) {
            A = {2, 3, 5, 7};
        } else {
            A = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37};
        }
        for(int a : A) {
            ll p = power(a, d, n);
            int i = s;
            while(p != 1 && p != n - 1 && a % n && (--i)) {
                p = mul(p, p, n);
            }
            if(p != n - 1 && i != s) {
                return false;
            }
        }
        return true;
    }
    ll rho(ll n) {
        auto f = [&](ll a) { return mul(a, a, n) + 1; };
        ll x = 0, y = 0, p = 2, q;
        int i = 1, t = 0;
        while((t++) % 40 || gcd(p, n) == 1) {
            if(x == y) {
                x = ++i;
                y = f(x);
            }
            if(q = mul(p, abs(y - x), n)) {
                p = q;
            }
            x = f(x);
            y = f(f(y));
        }
        return gcd(p, n);
    }
    vector<ll> factor(ll n) {
        if(n == 1) {
            return {};
        }
        if(isPrime(n)) {
            return {n};
        }
        ll a = rho(n);
        assert(a != n && a != 1);
        auto l = factor(a), r = factor(n / a);
        l.insert(l.end(), r.begin(), r.end());
        return l;
    }
};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    vector<ll> a(n);
    for(int i = 0; i < n; i++) {
        cin >> a[i];
    }
    set<ll> se;
    bool ok = true;
    FastFactorize f;
    for(int i = 0; i < n; i++) {
        auto v = f.factor(a[i]);
        sort(ALL(v));
        v.erase(unique(ALL(v)), end(v));
        for(auto j : v) {
            if(se.count(j)) {
                ok = false;
            }
            se.insert(j);
        }
    }
    if(ok) {
        cout << "pairwise coprime\n";
        return 0;
    }
    ll g = 0;
    for(int i = 0; i < n; i++) {
        g = gcd(g, a[i]);
    }
    if(g == 1) {
        cout << "setwise coprime\n";
    } else {
        cout << "not coprime\n";
    }
}