#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 2000000010;
constexpr ll INF= 2000000000000000000;
constexpr ll MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<ll,ll> P;
typedef pair<int,P> PP;

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;
}

ll mod(ll val, ll M) {
    ll res = val % M;
    if(res < 0) {
        res += M;
    }
    return res;
}

template<typename T>
T RS(T N, T P, T M){
    if(P == 0) {
        return 1;
    }
    if(P < 0) {
        return 0;
    }
    if(P % 2 == 0){
        ll t = RS(N, P/2, M);
        if(M == -1) return t * t;
        return t * t % M;
    }
    if(M == -1) {
        return N * RS(N,P - 1,M);
    }
    return N * RS(N, P-1, M) % M;
}

int main() {
    int N;
    cin >> N;
    vector<int> vec(N);
    for(int i = 0;i < N;i++) {
        cin >> vec.at(i);
    }
    int cnt = vec.at(0);
    for(int i = 1;i < N;i++) {
        cnt = gcd(cnt,vec.at(i));
    }
    vector<int> cnt2(100000);
    for(int i = 0;i < N;i++) {
        for(int j = 2;j * j <= vec.at(i);j++) {
            if(vec.at(i) % j == 0) {
                cnt2.at(j)++;
                while(vec.at(i) % j == 0) {
                    vec.at(i) /= j;
                }
            }
        }
        if(vec.at(i) != 1) {
            cnt2.at(vec.at(i))++;
        }
    }
    bool ret = true;
    for(int i = 0;i < 100000;i++) {
        if(cnt2.at(i) >= 2) {
            ret = false;
        }
    }
    if(ret == true) {
        cout << "pairwise coprime" << endl;
    }
    else if(cnt == 1) {
        cout << "setwise coprime" << endl;
    }
    else {
        cout << "not coprime" << endl;
    }
}