#include<bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define For(i,a,b) for(long long i=a;i<b;i++)
#define pb push_back
using namespace std;
typedef long long ll;
ll power(ll x,ll y,ll p){
ll res = 1;x = x % p;
while (y > 0){
if (y & 1){res = (res*x) % p;}
y = y>>1;
x = (x*x) % p;}
return res;}
ll mcd(ll a,ll b){
    if(b>a)swap(a,b);
    if(b==0)return a;
    else return mcd(b,a%b);
}
ll t,n,m,k;
bool esprimo(ll n){
ll s=0;
for(ll i=1;i*i<=n;i++){
    if(n%i==0){s++;}}
if(s>=2){return false;}
return true;
}
ll b[1000005];
vector<ll> gtf(ll x){
vector<ll> ans;
ll y=x;
for(ll i=2;i*i<=x;i++){
    ll p=0;
    while(y%i==0){
        y/=i;
        if(p==0)ans.pb(i);
        p++;
    }
}
if(y!=1){
ans.pb(y);
}
return ans;
}


int main(){
    //    cout<<fixed<<setprecision(2);
//cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
memset(b,0,sizeof b);
cin>>n;
ll a[n];
t=0;
for(int i=0;i<n;i++){
cin>>a[i];
vector<ll> cur;
cur=gtf(a[i]);
    for(int j=0;j<cur.size();j++){
        if(b[cur[j]]!=0){
            t++;
        }
        b[cur[j]]++;
    }
}
ll g=a[0];

if(t!=0){
for(int i=0;i<n;i++){
g=__gcd(g,a[i]);
}
if(g==1){
cout<<"setwise coprime"<<endl;
}else{
cout<<"not coprime"<<endl;
}
}else{

cout<<"pairwise coprime"<<endl;
}


}

