#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <utility>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <ctime>
#include <cctype>
#include <cstdlib>
#include <numeric>
#define IINF 1000000000
#define INF 3223372036854775807
#define MOD 1000000007
#define mod 1000000007
#define INT_MAX_ 2147483647
#define EPS (1e-10)
#define REP(i, a, n) fo-r (ll i = a; i < (ll)(n); i++)
#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)
//#define rep(i,n)for (ll i = 0; i < (ll)(n); i++)
#define rep(i,l,r)for(ll i=(l);i<(r);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define mmax(x,y)(x>y?x:y)
#define mmin(x,y)(x<y?x:y)
#define chmax(x,y) x=mmax(x,y)
#define chmin(x,y) x=mmin(x,y)
#define all(x) (x).begin(),(x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
#define me memset
#define bit(n,k) ((n>>k)&1)
#define lg length()
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<int,int>Pin;
typedef pair<ll,ll>Pll;
template<class T> using V=vector<T>;
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T> >;
long long GCD(long long a, long long b) {return b?GCD(b,a%b):a;}
long long LCM(long long a, long long b) {return a/GCD(a,b)*b;}
ll pom(ll a,ll n,int m){ll x=1;for(a%=m;n;n/=2)n&1?x=x*a%m:0,a=a*a%m;return x;}
#define invp(a,p)pom(a,p-2,p)
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
int ddx[8]={-1,0,1,0,1,1,-1,-1};
int ddy[8]={0,-1,0,1,1,-1,1,-1};
ll cmp1(pair<Pll,ll> a,pair<Pll,ll> b){
        return a.fi.se>b.fi.se;
}
ll cmp2(pair<ll,ll> a,pair<ll,ll> b){
    if(a.se!=b.se)
        return a.se<b.se;
    else
        return a.fi<b.fi;
}
//----------------------------------------------------------------------
#define N 100000
vector<ll>prime(N);
void makeprime() {
        int j, n = 29, i = 9, sqrtn;//从第10个质数开始计算，第10个质数是29
        prime[0] = 2;
        prime[1] = 3;
        prime[2] = 5;
        prime[3] = 7;
        prime[4] = 11;
        prime[5] = 13;
        prime[6] = 17;
        prime[7] = 19;
        prime[8] = 23; //之前已有9个质数在表中
        while (i < N) {
            j = 0; //每次从表头开始试除
            sqrtn = sqrt(n); //n的平方根
            while (prime[j] <= sqrtn) {
                if (n % prime[j] == 0) break; //若n能整除质数表中的某数，则跳出
                j++;
            }
            if (prime[j] > sqrtn) {
                prime[i] = n;
                i++;
            }
            n += 2; //除了2，偶数不会是质数，因此跳过所有偶数
        }
}
//----------------------------------------------------------------------
int main(int argc, char * argv[]){
    cin.tie(0);
    ios::sync_with_stdio(false);
    //-------------------------------  
    //ll begin_t=clock();
    //freopen("big.txt", "r", stdin);
    //freopen("out3.txt", "w", stdout);
    //------------------------------
    ll n;cin>>n;
    V<ll>a(n);
    for(ll i=0;i<n;i++){
        cin>>a[i];
    }
    ll x = a[0];
    for(ll i=1;i<n;i++){
        x = GCD(x,a[i]);
    }
    if(x!=1){
        cout<<"not coprime"<<endl;
        return 0;
    }
    ll even=0;
    for(ll i=0;i<n;i++){
        if(a[i]%2==0)even++;
    }
    if(even>=2){
        cout<<"setwise coprime"<<endl;
        return 0;
    }
    //
    sort(all(a));
    makeprime();
    map<ll,ll>M;
    for(ll i=0;i<n;i++){
        ll ia=a[i];
        for(ll j=0;j<N;j++){
            if(prime[j]*prime[j]>ia)break;
            if(a[i]%prime[j]==0){
                M[prime[j]]++;
                if(M[prime[j]]>=2){
                    cout<<"setwise coprime"<<endl;
                    return 0;
                }
                //ll x = a[i]
                while(a[i]%prime[j]==0)
                    a[i]/=prime[j];
                if(a[i]==1)break;
            }
        }
        if(a[i]>1){
            M[a[i]]++;
            if(M[a[i]]>=2){
                cout<<"setwise coprime"<<endl;
                return 0;
            }
        }
    }
    cout<<"pairwise coprime"<<endl;
    //------------------------------
    //fclose(stdin);
    //fclose(stdout);
    //ll end_t=clock();cout<<"time="<<end_t-begin_t<<"ms"<<endl;
    //------------------------------- 
    return 0;
}
//----------------------------------------------------------------------











































Measured memory_bytes: 11920