#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds;
using namespace std;
typedef tree<pair<int,int>,null_type,less<pair<int,int>>,rb_tree_tag,tree_order_statistics_node_update> oset;
#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 {
#ifdef LOCAL
~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;
#define ar array 

const int nax = 1e6+5;
set<int> prime;
bool vis[nax] , vis2[nax];

void build(){
	for(int i = 2 ; i < nax ; i++){
		if(!vis[i]){
			prime.insert(i);
			for(int j = i ; j < nax ; j+=i)
				vis[j] = 1;
		}
	}
}

void test_case() {
	int n;
	cin >> n;
	vector<int> a(n);
	vector<int> c(nax);
	for(int i = 0 ; i < n ; i++){
		cin >> a[i];
		c[a[i]]++;
	}
	bool pairwise = true;
	for(int i = 2 ; i < nax ; i++) {
		int cnt = 0;
		for(int j = i ; j < nax ; j+=i){
			cnt+=c[j];
		}
		if(cnt > 1){
			pairwise = false;
		}
	}
	if(pairwise){
		cout<<"pairwise coprime\n";
		return;
	}
	int g = 0;
	for(int i = 0 ; i < n ; i++)
		g = __gcd(g,a[i]);
	if(g == 1){
		cout<<"setwise coprime\n";
		return;
	}
	cout<<"not coprime\n";	
}
 
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	build();
	cout<<prime.size();
	int T = 1;
	//~ cin >> T;
	while(T--){
		test_case();
	}
}

// problem is easy but implement is hard for you broooo
// improveeeeeeeeeeeeeeeeee
// read carefully
// we have to check for every two pair of element in array...
 
