#include<bits/stdc++.h>

using namespace std;
using   ll=long long;

#define fast            ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)

#define endl            "\n"
#define pb              push_back
#define mp              make_pair
#define F               first
#define S               second
#define int             long long int
#define pll                pair<int , int>

#define ALL(v)          v.begin(),v.end()
#define ALLR(v)         v.rbegin(),v.rend()
#define pii             3.14159265358979323
#define inf             LLONG_MAX
#define ones(x)         __builtin_popcount(x)
#define fill(a,b)       memset(a,b,sizeof(a))
#define mod             1000000007
#define hell            998244353

ll mod_pow(ll a,ll b,ll m)
{
    ll res = 1;
    while(b)
    {
        if(b&1)
        {
            res=(res*a) % m;
        }
        a=(a*a) % m;
        b>>=1;
    }
    return res;
}

ll mod_inverse(ll a)
{
    return mod_pow(a , mod-2 , mod);
}

const int maxn = 1e6 + 1;

map<int,int> f;

int ok = 1;

map<int,int> jj;

int vis[maxn];

void go() 
{
	for(int i = 2; i < maxn; ++i) {
		if(!vis[i]) {
			for(int j = i; j < maxn; j += i) {
				if(f[j] > 0) {
					jj[i]++;
				}
				
				vis[j] = 1;
			}
		}
	}
}

void solve()
{
	int n;
	
	cin >> n;
	
	int a[n];
	
	int g = 0;
	
	for(int i = 0; i < n; ++i) {
		cin >> a[i];
		
		f[a[i]]++;
		
		g = __gcd(g , a[i]);
	}
	
	go();
	
	for(auto u : jj) {
		if(u.S > 1) {
			ok = 0;
		}
	}
	
	if(ok) {
		cout << "pairwise coprime";
	}
	else {
		if(g == 1) {
			cout << "setwise coprime";
		}
		else {
			cout << "not coprime";
		}
	}
}

signed main() {
    fast;

    int t = 1;
   
    //cin >> t;

    while(t--) {
        solve();
    }

    return 0;
}
