#include<bits/stdc++.h>
using namespace std;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifndef ONLINE_JUDGE
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
using ll = long long;
const int nax = 1e4+500;
const ll inf = 1e18+5;
bool isPrime(int n) {
	for(int i= 2;i<=sqrt(n);i++) {
		if(n%i == 0) return false;
	} 
	return true;
}
int main() {
	int n;
	cin >> n;
	int wgcd = 0;
	vector<int> a(n);
	for(int &i:a) {
		cin >> i;
		wgcd = __gcd(wgcd,i);
	}
	map<int,int> mp;
	for(auto it:a) {
		if(it == 1) continue;
		if(isPrime(it)) {
			//debug()<<imie(it);
			mp[it]++;
			continue;
		}
		for(int i= 2;i<=sqrt(it);i++) {
			if(it%i ==0) {
				mp[i]++;
				if(it/i != i) mp[it/i]++;
			}
		}
	}
	int maxi = 0;
	for(auto it:mp) {
			if(it.second > maxi) {
				maxi = it.second;
				debug()<<imie(it.first);
			}
	}
	//debug()<<imie(wgcd) imie(maxi);
	if(wgcd == 1) {
		if(maxi < 2) cout<<"pairwise coprime";
		else cout<<"setwise coprime";
	} else {
		cout<<"not coprime";
	}
}
