#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 sieve[nax];
vector<int> primes;
void init() {
	for(int i = 2; i*i<nax;i++) {
		if(!sieve[i]) {
			for(int j=i*2;j<=nax;j+=i) {
				sieve[j] = 1;
			}
		}
	}
	for(int i=2;i<nax;i++) {
		if(!sieve[i]) {
			primes.push_back(i);
		}
	}
}
int main() {
	init();
	int n;
	cin >> n;
	int wgc = 0;
	vector<int> a(n);
	for(int i=0;i<n;i++) {
		cin >> a[i];
		wgc = __gcd(wgc, a[i]);
	}
	map<int,int> mp;
	for(int i=0;i<n;i++) {
		for(int j=0;j<(int)primes.size();j++) {
			if(primes[j] > a[i]) break;
			if(a[i] % primes[j] ==0) {
				mp[primes[j]]++;
			}
		} 
	}
	int maxi = 0;
	for(auto it:mp) {
		maxi = max(maxi, it.second);
	}
	if(maxi >=2 && wgc == 1) {
		cout<<"setwise coprime";
	} else if(maxi <2 && wgc == 1) {
		cout<<"paiwise coprime";
	} else {
		cout<<"not coprime";
	}
	
}
