#include <iostream>
using namespace std;

int gcd(int a, int b) {return b ? gcd(b, a % b) : a;}

int n, cnt[1000001];
bool flag = 0;

int main()
{
	int res = 0;
	cin >> n;
	for (int i = 0; i < n; i++) {int x; cin >> x; cnt[x]++; res = gcd(res, x);}
	for (int i = 2; i <= 1000000; i++)
	{
		int c = 0;
		for (int j = i; j <= 1000000; j += i) {c += cnt[j];}
		if (c > 1) {flag = 1; break;}
	}
	if (flag)
	{
		if (res == 1) {cout << "setwise coprime\n";}
		else {cout << "not coprime\n";}
	}
	else {cout << "pairwise coprime\n";}
	return 0;
}