#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize ("Ofast")
#pragma GCC optimization ("unroll-loops, no-stack-protector")
#pragma GCC target ("avx")
#pragma GCC target ("avx2")
#pragma GCC target ("fma")
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair <int, int>
#define pll pair <ll, ll>
#define pci pair <char, int>
#define pld pair <ld, ld>
#define ppld pair <pld, pld>
#define ppll pair <pll, pll>
#define pldl pair <ld, ll>
#define vll vector <ll>
#define vvll vector <vll>
#define vpll vector <pll>
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define mll map <ll, ll>
#define fastmap gp_hash_table
#define cd complex <double>
#define vcd vector <cd>
#define PI 3.14159265358979
#define ordered_set tree <ll, null_type, less <ll>, rb_tree_tag, tree_order_statistics_node_update>
#pragma 03
using namespace std;
using namespace __gnu_pbds;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
bool ex[1000005];
int main(){
	fastio;
	ll n; cin >> n;
	ll g = 0;
	bool pc = 1;
	for (ll i = 0; i < n; i++){
		ll ip; cin >> ip; g = __gcd(g, ip); 
		if (ex[ip] == 0) ex[ip] = 1;
		else pc = 0;
	}
	for (ll i = 2; i < 1000005; i++){
		ll cnt = 0;
		for (ll j = i; j < 1000005; j += i) cnt += ex[j];
		if (cnt >= 2) pc = 0; 
	}
	if (pc){
		cout << "pairwise coprime\n"; 
	}
	else if (g == 1){
		cout << "setwise coprime\n";
	}
	else{
		cout << "not coprime\n";
	}
}