#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize ("-ffloat-store") // to restrict undesirable precision
#pragma GCC optimize ("-fno-defer-pop")// to pop argument of function as soon as it returns
#define all(a) a.begin(),a.end()
#define ll long long int
#define ld long double
ll power(ll a,ll b,ll m){ if(b==0) return 1; if(b==1) return a%m; ll t=power(a,b/2,m)%m; t=(t*t)%m; if(b&1) t=((t%m)*(a%m))%m; return t;}
ll modInverse(ll a, ll m) { return power(a, m-2, m); }
#define ps push_back
#define fs first
#define sc second
#define takeline cin.ignore();
#define iactive cout.flush();
#define N 1000005
#define endl "\n"
#define mod 1000000007
#define PI 3.141592653589793
//((1.0l)*BIG MULTIPLY MAGIC?)
// string to integer stoi()
// string to long long stoll()
// string.substr(position,length);
// integer to string to_string();
//----------------------------------------------
ll st[N],ar[N]; bool prm[1000001]; vector<ll> pm;
void SIE()
{
    for(ll i=1;i<=1000000;i++){
    	prm[i]=true;
	}
	prm[1]=false;
    for (ll j=2; j*j<=1000000; j++)
    {
        if (prm[j] == true)
        {
        	pm.ps(j);
            for (ll i=j*2; i<=1000000; i += j)
                prm[i] = false;
        }
    }
}
int main(){

	ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);	
	
	ll i,j,k,l,n;
	cin>>n;
	ll tg=0;
	for(i=1;i<=n;i++){
		cin>>ar[i];
		tg=__gcd(tg,ar[i]);
	}
	SIE();
	// cout<<pm.size()<<endl;
	// for(auto it:pm){
	// 	cout<<it<<" ";
	// }cout<<endl;
	for(i=1;i<=n;i++){
		for(auto it:pm){
			if(ar[i]%it==0){
				st[it]++;
			}
		}
	}

	ll fl=1,f2=1;
	for(i=1;i<=n;i++){
		ll c=0;
		for(auto it:pm){
			if(ar[i]%it==0){
				c+=(st[it]-1);
			}
		}
		// cout<<i<<" "<<c<<endl;
		if(c>0){
			fl=0;
		}
		if(c<n-1){
			f2=0;
		}
	}
	if(fl){
		cout<<"pairwise coprime"<<endl;
	}
	else if(f2&&tg==1){
		cout<<"setwise coprime"<<endl;
	}
	else cout<<"not coprime"<<endl;
	return 0;	
}