#include <cstring>
#include <cassert>
#include <utility>
#include <iostream>
#include <cstdio>
#include <iomanip>
#include <bitset>
#include <chrono>
#include <cstdlib>
#include <functional>
#include <tuple>
#include <climits>
#include <limits>
#include <deque>
#include <list>
#include <array>
#include <stack>
#include <queue>
#include <random>
#include <complex>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#define ll              long long
#define pi              pair<int,int>
#define pll             pair<ll,ll>
#define pb              push_back
#define F               first
#define S               second
#define vi              vector<int>
#define vll             vector<ll>
#define endl            '\n'
#define all(v)          (v).begin(),(v).end()
#define FOR(i,a,b)      for(int i=a;i<b;i++)
#define MP(a,b)         make_pair(a,b)
#define debug(x)        cerr<< #x << " : " << x << endl;
#define debugp(p)       cerr<< #p << " : " << "(" << (p).first << "," << (p).second << ")\n";
#define debugv(v)       cerr<< #v << " : " << "["; for(int i = 0; i < (v).size(); i++) cerr << v[i] << " "; cerr<<"]\n";
#define debugs(m)       cerr<< #m << " : [ "; for(auto itr = m.begin(); itr != m.end(); itr++) cerr <<*itr << " "; cerr << "]\n";
#define debugm(m)       cerr<< #m << " : [ "; for(auto itr = m.begin(); itr != m.end(); itr++) cerr <<"(" << itr->first << "," << itr->second << ") "; cerr << "]\n";

/* ordered set: 
tree<T, null_type,less<T>, rb_tree_tag,tree_order_statistics_node_update>
member functions :
1. order_of_key(k) : number of elements strictly lesser than k
2. find_by_order(k) : k-th element in the set
*/

inline ll modexp(ll x, ll ex , ll md) {
    ll ans = 1ll;
    while (ex > 0) {
        if (ex & 1ll) ans = (ans * x) % md;
        ex >>= 1ll;
        x = (x * x) % md;
    }
    return ans;
}

const int inf = 1e9 + 7;
const int maxn = 1e6 + 8;
ll spf[maxn];

void si (){
    spf[1] = 1;
    int N = 1e6 + 5;
    for (int i = 2; i <= N; i++){
        if (spf[i] == 0){
            spf[i] = i;
            for (ll j = 1ll * i * i; j <= N; j += i){
                spf[j] = i;
            }
        }
    }
}

void solve(){
    int n;
    cin >> n;
    vector<ll> a(n);
    for (int i = 0; i < n; i++){
        cin >> a[i];
    }
    si();
    // cout << "sfp : ";
    // for (int i = 1; i <= 20; i++){
    //     cout << spf[i] << " ";
    // }
    // cout << endl;
    map<ll , ll> seen;
    bool bad = false;
    for (int i = 0; i < n; i++){
        ll el = a[i];
        // cout << "for a[i] = " << a[i] << endl;
        while (el != 1){
            ll pr = spf[el];
            if (seen.count (pr)){
                bad = true;
                break;
            }
            seen[pr] = 1 ;
            // cout << "pr : " << pr << endl;
            while (el % pr == 0) el /= pr;
        }
        if (bad) break;
    }
    ll cg = 1;
    if (bad){
        cg = a[0];
        for (int i = 1; i < n; i++){
            cg = __gcd (cg , a[i]);
        }
    }
    if (!bad){
        cout << "pairwise coprime\n";
        return;
    }
    if (cg == 1){
        cout << "setwise coprime\n";
        return;
    }
    cout << "not coprime\n";
    return;
}
int main(){
    ios :: sync_with_stdio(false); 
    cin.tie(nullptr); 
    cout.tie(nullptr);
    
    int T = 1;
    // cin >> T;
    for(int tc = 1; tc <= T; tc++){
        // cout << "Case #" << tc << ": ";
        solve();
    }
    #ifdef LOCAL
    cerr << "Time elapsed\t: " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << "ms\n";       
    #endif
}



Measured memory_bytes: 18736