#define INF 10000000000
#define MOD 1000000007

#if 1   // use_templates

#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <algorithm>
#include <functional>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define rep(i, up) for (ll i = 0; i < (up); ++i)
#define repp(i, up) for (ll i = 0; i <= (up); ++i)
#define rrep(i, lo, up) for (ll i = (lo); i < (up); ++i)
#define rrepp(i, lo, up) for (ll i = (lo); i <= (up); ++i)
#define eep(i, lo, up) for ((i) = (lo); (i) < (up); ++(i))
#define eepp(i, lo, up) for ((i) = (lo); (i) <= (up); ++(i))
#define feach(it, vec) for (auto it = (vec).begin(); it != (vec).end(); ++it)
#define emax(l, r) l = max(l, r)
#define vmin(l, r) l = min(l, r)

template<class T, class U>
bool contains(const T & vec, const U & value) {
    return vec.find(value) != vec.end();
}

ll gcd(ll a, ll b);

ll gcd(ll a, ll b)
{
    if (a < b) {
        return gcd(b, a);
    }
    ll r;
    while (r = a % b) {
        a = b;
        b = r;
    }
    return b;
}

#endif  // end of use_templates


ll primes[] = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997 };

set<ll> factor(ll x) {
    set<ll> result;
    for (ll i = 0; i < sizeof(primes) / sizeof(primes[0]) && primes[i] * primes[i] <= x; ++i) {
        if (x % primes[i] != 0) {
            continue;
        }
        result.insert(primes[i]);
        while (x % primes[i] == 0) {
            x /= primes[i];
        }
        if (x == 1) {
            break;
        }
    }
    if (x != 1) {
        result.insert(x);
    }
    return result;
}

int main()
{
    ll n;
    cin >> n;
    vector<ll> a(n);
    rep(i, n) {
        cin >> a[i];
    }
    set<ll> lcm;
    set<ll> gcd;
    bool flg_lcm = true;
    bool flg_gcd = true;
    rep(i, n) {
        auto fs = factor(a[i]);
        if (flg_lcm) {
            feach(it, fs) {
                if (contains(lcm, *it)) {
                    flg_lcm = false;
                    break;
                } else {
                    lcm.insert(*it);
                }
            }
        }
        if (flg_gcd) {
            gcd = fs;
            flg_gcd = false;
        } else {
            if (gcd.size() > 0) {
                set<ll> work;
                set_intersection(gcd.begin(), gcd.end(), fs.begin(), fs.end(), inserter(work, work.begin()));
                gcd = work;
            }
        }
    }
    if (flg_lcm) {
        cout << "pairwise coprime" << endl;
    } else if (gcd.size() == 0) {
        cout << "setwise coprime" << endl;
    } else {
        cout << "not coprime" << endl;
    }
    return 0;
}


Measured memory_bytes: 10684