//In the name of Allah :)
#include <bits/stdc++.h>
using namespace std;
string to_string(char c) { return string(1,c); }
string to_string(bool b) { return b ? "true" : "false"; }
string to_string(const char* s) { return (string)s; }
string to_string(string s) { return s; }
template<class A> string to_string(complex<A> c) { 
	stringstream ss; ss << c; return ss.str(); }
string to_string(vector<bool> v) { 
	string res = "{"; for(int i = 0; i < (int)v.size(); i++) res += char('0'+v[i]);
	res += "}"; return res; }
template<size_t SZ> string to_string(bitset<SZ> b) {
	string res = ""; for(size_t i = 0; i < SZ; i++) res += char('0'+b[i]);
	return res; }
template<class A, class B> string to_string(pair<A,B> p);
template<class T> string to_string(T v) { // containers with begin(), end()
	bool fst = 1; string res = "{";
	for (const auto& x: v) {
		if (!fst) res += ", ";
		fst = 0; res += to_string(x);
	}
	res += "}"; return res;
}
template<class A, class B> string to_string(pair<A,B> p) {
	return "("+to_string(p.first)+", "+to_string(p.second)+")"; }
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
	cerr << to_string(h); if (sizeof...(t)) cerr << ", ";
	DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define wis(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "] : [", DBG(__VA_ARGS__)
#else
#define wis(...) 0
#endif
typedef long long ll;
#define all(x) (x).begin(), (x).end()
const int MOD = 1e9 + 7, INF = 1e9 + 5;
const ll LONG_INF = 1e18 + 10;
inline ll powmod(ll a, ll b){ll res=1;for(;b;b>>=1,a=a*a%MOD)if(b&1)res=res*a%MOD;return res;}
inline ll power(ll a, ll b){ll res=1;for(;b;b>>=1,a=a*a)if(b&1)res=res*a;return res;}

const int MAXN = 1e6 + 10;

int main(){
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
        bitset <MAXN> isprime;
        vector <int> factor(MAXN);
        isprime.set();
        isprime[0] = isprime[1] = 0;
        vector <int> primes;
        for(int i = 2; i < MAXN; i++){
                if(!isprime[i])
                        continue;
                primes.push_back(i);
                for(ll j = (ll) i * i; j < MAXN; j += i){
                        isprime[j] = 0;
                        factor[j] = i;
                }
        }
        bool pc = 1;
	int n;
        cin >> n;
        vector <int> a(n);
        bitset <MAXN> mark;
        for(int i = 0; i < n; i++){
                int x;
                cin >> x;
                a[i] = x;
                set <int> prime;
                while(!isprime[x] && x != 1){
                        prime.insert(factor[x]);
                        x /= factor[x];
                }
                for(int j : prime){
                        if(mark[j])
                                pc = 0;
                        mark[j] = 1;
                }
        }
        if(pc){
                cout << "pairwise coprime\n";
                return 0;
        }
        int res = a[0];
        for(int i = 1; i < n; i++){
                res = gcd(res, a[i]);
        }
        if(res == 1){
                cout << "setwise coprime\n";
        }
        else{
                cout << "not coprime\n";
        }
}
