#include<bits/stdc++.h>
using namespace std;
#define fastIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long int
#define fi first
#define se second
#define pub push_back
#define pi pair<int,int>
#define all(v) (v).begin(), (v).end()
#define rep(i, l, r) for(int i=(int)(l);i<(int)(r);i++)
#define repd(i, l, r) for (int i=(int)(l);i>=(int)(r);i--)
#define clrg(i, l, r) for(int i=(int)(l);i<(int)(r);i++)vis[i]=0,v[i].clear();
int power(int x, unsigned int y){int res = 1;while (y > 0){ if (y & 1){res = res*x;} y = y>>1;x = x*x;}return res;}
int powermod(int x, unsigned int y, int p){int res = 1;x = x % p;while (y > 0){if (y & 1){res = (res*x) % p;}y = y>>1; x = (x*x) % p;}return res;}
#define print2d(mat,n,m){for(int i=0;i<(int)(n);i++){for(int j=0;j<(m);j++){cout<<mat[i][j]<<" ";}cout<< endl;}}
#define clr(a,x) memset(a,x,sizeof(a))
#define rr(v) for(auto &val:v)
#define print(v) for (const auto itr : v){cout<<itr<<' ';}cout<<"\n";
#define ln length()
#define sz size()
#define mod 1000000007
#define elif else if
const int MAX = 1e6+5;
vector<int> lp, primes;
void factor_sieve()
{
    lp.resize(MAX);
    lp[1] = 1;
    for (int i = 2; i < MAX; ++i)
    {
        if (lp[i] == 0)
        {
            lp[i] = i;
            primes.emplace_back(i);
        }
        for (int j = 0; j < primes.size() && primes[j] <= lp[i]; ++j)
        {
            int x = i * primes[j];
            if (x >= MAX)
                break;
            lp[x] = primes[j];
        }
    }
}
int32_t main(){
    factor_sieve();
  int n; cin>>n;
  vector<int> v(n);
  rep(i,0,n)cin>>v[i];
  set<int> s;
  int ok=1;
    rep(i,0,n){
        set<int> st;
        int x=v[i];
        while(x!=1){
             st.insert(lp[x]),x/=lp[x];
        }
        rr(st){
            if(s.find(val)!=s.end()){
                ok=0;
                break;
            }
            s.insert(val);
        }
    }
    int gcd=0;
    rep(i,0,n){
        gcd=__gcd(gcd,v[i]);
    }
    if(!ok){
        if(gcd==1)cout<<"setwise coprime\n";
        else cout<<"not corpime\n";
        return 0;
    }
    cout<<"pairwise coprime\n";
   return 0;
}
/*
Edge cases? n=1? a[i]<=0?
long vs int? 1LL? 64bits?
Re-read problem. Is it as easy as it seems?
KEEP CORRECTING AND SUBMITTING!
*/
