#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;

const int A = 1000005;

int main() {
	int n;
	cin >> n;
	vector<int> a(n);
	vector<int> c(A,0);
	rep(i,n) {
		cin >> a[i];
		c[a[i]]++;
	}
	bool pairwize = true;
	for (int i=2;i < A;i++) {
		int cnt = 0;
		for (int j=i;j < A;j += i)
			cnt += c[j];
		if (cnt > 1) {
			pairwize = false;
			break;
		}
	}
	if (pairwize){
		cout << "pairwize coprime" << endl;
		return 0;
	}
	int g = 0;
	rep(i,n) g = gcd(a[i], g);
	if (g == 1) cout << "setwize coprime" << endl;
	else cout << "not coprime" << endl;
	return 0;
}
