//@formatter:off
#include<bits/stdc++.h>
#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 rep2(i,s,n) for (int i = int(s); i < int(n); ++i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vd vector<double>
#define vvd vector<vector<double>>
#define vs vector<string>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
#define vp vector<P>
#define vvp vector<vector<P>>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using LP = pair<ll,ll>;
template<class S,class T> istream& operator>>(istream &is,pair<S,T> &p) { return is >> p.first >> p.second; }
template<class S,class T> ostream& operator<<(ostream &os,const pair<S,T> &p) { return os<<'{'<<p.first<<","<<p.second<<'}'; }
template<class T> istream& operator>>(istream &is,vector<T> &v) { for(T &t:v){is>>t;} return is; }
template<class T> ostream& operator<<(ostream &os,const vector<T> &v) { os<<'[';rep(i,v.size())os<<v[i]<<(i==int(v.size()-1)?"":","); return os<<']'; }
void Yes(bool b) { cout << (b ? "Yes" : "No") << '\n'; }
void YES(bool b) { cout << (b ? "YES" : "NO") << '\n'; }
template<class T> bool chmin(T& a,T b) {if(a > b){a = b; return true;} return false;}
template<class T> bool chmax(T& a,T b) {if(a < b){a = b; return true;} return false;}
const int inf = 1001001001;
const ll linf = 1001001001001001001;
//@formatter:on

class sieve {
    int n;
    vi val;
    
    void init() {
        rep(i, n + 1) val[i] = i;
        for (int i = 2; i * i <= n; i++) {
            if (val[i] != i) continue;
            for (int j = i * 2; j <= n; j += i) {
                if (val[j] == j) val[j] = i;
            }
        }
    }

public:
    sieve(int n) : n(n), val(n + 1) {
        init();
    }
    
    map<int, int> factorlist(int x) {
        if (n < 2) return {};
        map<int, int> ret;
        int now = x;
        while (now > 1) {
            ret[val[now]]++;
            now /= val[now];
        }
        return ret;
    }
    
    vi unique_factor(int x) {
        map<int, int> m = factorlist(x);
        vi ret;
        for (P p : m) ret.pb(p.first);
        return ret;
    };
    
    bool isPrime(int x) {
        return x >= 2 and val[x] == x;
    }
    
    int count_divisor(int x) {
        int ret = 1;
        map<int, int> fl = factorlist(x);
        for (auto p : fl) ret *= p.second + 1;
        return ret;
    };
} sv(1000010);

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n;
    cin >> n;
    vi a(n);
    cin >> a;
    int g = a[0];
    rep2(i, 1, n) {
        g = gcd(g, a[i]);
    }
    if (g != 1) {
        cout << "not coprime" << endl;
        return 0;
    }
    set<int> st;
    rep(i, n) {
        vi v = sv.unique_factor(a[i]);
        for (int j : v) {
            if (st.count(j)) {
                cout << "setwise coprime" << endl;
                return 0;
            }
            st.insert(j);
        }
    }
    cout << "pairwise coprime" << endl;
}

Measured memory_bytes: 11120