#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long int
// #define ll long long int
#define ld long double
#define ff first
#define ss second
#define mp make_pair
#define IOS std::ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define pb push_back
#define eb emplace_back
#define pii pair<int, int>
#define endl '\n'
#define all(x) x.begin(),x.end()
#define f(i,j,l) for(i=j;i<l;i++)
#define smax(a,b) a=max(a,b)
// #if !defined(ONLINE_JUDGE)
// #include "debugging.h"
// #endif
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// find_by_order(k)  returns iterator to kth element starting from 0;
// order_of_key(k) returns count of elements strictly smaller than k;
// erase,insert same as normal set

// int const mod = 7340033;
// int const mod = 998244353;
long long const mod = 1e9+7;
int power(int a,int b,int m){
    int res = 1;
    while(b){
        if(b&1){
            // res = res*a;
            res = (res*a)%m;
        }
        a=(a*a)%m;
        // a%=m;
        b=b/2;
    }
    return res;
}

int inverse(int x , int m){
    return power(x,m-2,m);
}

int const N = 1e6+5;
int const inf = 2e9;

int p[N], cnt[N];

void precompute(){
    p[1] = 1;
    for(int i=2;i<N;i++){
        if(p[i] == 0){
            for(int j=i;j<N;j+=i){
                if(p[j] == 0) p[j] = i;
            }
        }
    }    
}

void solve(){  
    int i,j;
    int n; cin >> n;
    vector<int> a(n);
    int g = 0;
    for(auto &x:a){
        cin >> x;
        g == __gcd(g , x);
    }
    if(g > 1){
        cout << "not coprime" << endl; return;
    }
    int is = 0;
    for(auto x:a){
        int y = x;
        while(y > 1){
            int pp = p[y];
            cnt[pp]++;
            if(cnt[pp] > 1) is = 1;
            while(y%pp == 0){
                y = y/pp;
            }
        }
    }
    cout << (is ? "setwise coprime" : "pairwise coprime") << endl;
}              

int32_t main(){
    IOS;
    int t;
    t = 1;
    precompute();
    // cin>>t;  
    for(int tt=1;tt<=t;tt++){
        // cout << "Case #"<<tt<<": ";
        solve();
    }
    return 0;
}


/*  

*/