#include <bits/stdc++.h>

// ====================================================================
struct custom_hash {static uint64_t splitmix64(uint64_t x) {x += 0x9e3779b97f4a7c15; x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9; x = (x ^ (x >> 27)) * 0x94d049bb133111eb; return x ^ (x >> 31);} size_t operator()(uint64_t x) const {static const uint64_t FIXED_RANDOM = std::chrono::steady_clock::now().time_since_epoch().count(); return splitmix64(x + FIXED_RANDOM);}};
// ====================================================================

signed main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(NULL);

    int n;
    std::cin >> n;

    int max = 0;

    std::vector<int> a(n);
    for (int &i : a) {
        std::cin >> i;
        max = std::max(max, i);
    }

    int gcd = 0;
    for (int i : a) gcd = std::gcd(gcd, i);

    if (gcd != 1) {
        std::cout << "not coprime";
        return 0;
    }

    std::unordered_map<int, int, custom_hash> cnt;
    for (auto i : a) ++cnt[i];

    std::vector<int> ans(max + 1);

    for (int i = 1; i <= max; i++) {
        for (int j = i; j <= max; j += i) {
            ans[i] += cnt[j];
        }
    }

    for (int i = 2; i <= max; i++) {
        if (ans[i] > 1) {
            std::cout << "setwise coprime";
            return 0;
        }
    }

    std::cout << "pairwise coprime";

    return 0;
}

