#ifdef LOCAL
//#define _GLIBCXX_DEBUG
#endif
//#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<char> Vc;
typedef vector<P> VP;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
typedef vector<vector<char>> VVc;
typedef vector<vector<vector<ll>>> VVV;
typedef vector<vector<vector<vector<ll>>>> VVVV;

#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
const ll INF = 1e18+18;
const ll MOD = 1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a,b)
#define Each(a, b) for(auto &a :b)
#define rEach(i, mp) for (auto i = mp.rbegin(); i != mp.rend(); ++i)
#ifdef LOCAL
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define dbgmap(mp) cerr << #mp << ":"<<endl; for (auto i = mp.begin(); i != mp.end(); ++i) { cerr << i->first <<":"<<i->second << endl;}
#define dbgset(st) cerr << #st << ":"<<endl; for (auto i = st.begin(); i != st.end(); ++i) { cerr << *i <<" ";}cerr<<endl;
#define dbgarr(n, m, arr) rep(i,n){rep(j,m){cerr<<arr[i][j]<<" ";}cerr<<endl;}
#define dbgdp(n, arr) rep(i,n){cerr<<arr[i]<<" ";}cerr<<endl;
#else
#define dbg(...)
#define dbgmap(...)
#define dbgset(...)
#define dbgarr(...)
#define dbgdp(...)
#endif
#define out(a) cout<<a<<endl
#define out2(a, b) cout<<a<<" "<<b<<endl
#define vout(v) rep(i,v.size()){cout<<v[i]<<" ";}cout<<endl
#define Uniq(v) v.erase(unique(v.begin(), v.end()), v.end())
#define fi first
#define se second

template<class T>
bool chmax(T &a, const T &b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmin(T &a, const T &b) {
    if(b < a) {
        a = b;
        return true;
    }
    return false;
}

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

template<typename T>
istream &operator>>(istream &i, vector<T> &v) {
    rep(j, v.size())i>>v[j];
    return i;
}

// vector
template<typename T>
ostream &operator<<(ostream &s, const vector<T> &v) {
    int len = v.size();
    for(int i = 0; i < len; ++i) {
        s<<v[i];
        if(i < len-1) s<<"	";
    }
    return s;
}

// 2 dimentional vector
template<typename T>
ostream &operator<<(ostream &s, const vector<vector<T> > &vv) {
    int len = vv.size();
    for(int i = 0; i < len; ++i) {
        s<<vv[i]<<endl;
    }
    return s;
}

class smart_sieve {
    ll L, R, M;
    std::vector<int> small;  // 小さい篩
    std::vector<std::vector<ll>> large;  // 大きい篩
    std::vector<ll> aux;  // aux[i] := large[i] の素因数の積

public:
    smart_sieve(ll L, ll R): L(L), R(R), M(sqrt(R)+1) {
        small.resize(M);
        std::iota(small.begin(), small.end(), 0);
        large.resize(R-L);
        aux.assign(R-L, 1);

        for (ll i = 2; i*i < R; ++i) {
            if (small[i] < i) continue;
            small[i] = i;
            for (ll j = i*i; j < M; j += i)
                if (small[j] == j) small[j] = i;

            for (ll j = (L+i-1)/i*i; j < R; j += i) {
                ll k = j;
                do {
                    // aux[j-L] > M で判定した方がいいかも？
                    // j / aux[j-L] < M の方がいい？（割り算したくない）
                    if (aux[j-L] * aux[j-L] > R) break;

                    large[j-L].push_back(i);
                    aux[j-L] *= i;
                    k /= i;
                } while (k % i == 0);
            }
        }
    }

    Vec factor(ll n) {
        assert(L <= n && n < R);
        std::vector<ll> res = large[n-L];
        n /= aux[n-L];
        if (n >= M) {
            // この場合，n は素数となることが示せる（はず）
            // n*n >= R だとオーバーフローしそう？
            res.push_back(n);
            return res;
        }
        while (n > 1) {
            res.push_back(small[n]);
            n /= small[n];
        }
        return res;
    }
};
int solve() {
    ll n;
    cin>>n;
    Vec a(n);
    cin>>a;
    
    ll mx = 1e6;
    smart_sieve sieve(1,mx);
    bool ispairwise = true;

    map<ll, ll> mp;
    rep(i, n) {
        Vec fact = sieve.factor(a[i]);
        Uniq(fact);
        Each(x, fact){
            mp[x]++;
        }
    }

    Each(p, mp) {
        if(p.se >= 2) {
            ispairwise = false;
        }
    }

    ll G = a[0];
    REP(i, 1, n) {
        G = gcd(G, a[i]);
    }
    dbg(G);

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

    return 0;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout<<std::setprecision(10);
//    ll T;
//    cin>>T;
//    while(T--)
    solve();
}
