#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}void pr(){ln;}
template<class A,class...B>void pr(const A &a,const B&...b){cout<<a<<(sizeof...(b)?" ":"");pr(b...);}
template<class A>void PR(A a,ll n){rep(i,n)cout<<(i?" ":"")<<a[i];ln;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[8]={-1,0,1,0,-1,-1,1,1},dy[8]={0,1,0,-1,-1,1,1,-1};
typedef pair<ll,ll> P;

ll c[1111111];

void Main() {
  ll n;
  R n;
  ll a[n];
  rep(i,n) R a[i];
  ll d=a[n-1],f=0,ff=1;
  rrep(k,n) {
    d=__gcd(d,a[k]);
    if(a[k]!=1) ff=0;
    if(f) continue;
    vector<ll> v;
    for(ll i=2; i*i<=a[k]; i++) {
      if(a[k]%i==0) {
        v.pb(i);
        if(i*i!=a[k]) v.pb(a[k]/i);
      }
    }
    v.pb(a[k]);
    rep(i,v.size()) {
      c[v[i]]++;
      if(c[v[i]]>=2) {
        f=1;
        break;
      }
    }
  }
  if(ff) pr("pairwise coprime");
  else if(d!=1) pr("not coprime");
  else if(f) pr("setwise coprime");
  else pr("pairwise coprime");
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}
