#pragma GCC target ("avx2")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>
#define int long long
#define double long double
#define x first
#define y second
#define pb push_back
#define mp make_pair
#define xx exit(0)
#define yy cout<<"Yes\n"
#define nn cout<<"No\n"
#define ct continue
#define br break
#define rt return
using namespace std;
struct st{
	
};
bool cmp(){
	return 1;
}
void recur(){
	
}
int p[168]={2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997};
void solve(){
	int n;
	cin>>n;
	int a[n];
	bool occ[168];
	for (int i=0; i<168; i++) occ[i]=0;
	bool ok=1;
	for (int i=0; i<n; i++) cin>>a[i];
	for (int i=0; i<n; i++){
		for (int j=0; j<168; j++){
			if (a[i]%p[j]==0){
				if (!occ[j]) occ[j]=1;
				else {
					ok=0;
					goto q;
				}
			}
		}
	}
	q:;
	if (ok){
		cout<<"pairwise coprime\n";
		return;
	}
	int cur=a[0];
	for (int i=1; i<n; i++){
		cur=__gcd(cur,a[i]);
	}
	if (cur==1) cout<<"setwise coprime\n";
	else cout<<"not coprime\n";
	
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t=1;
	//cin>>t;
	while (t--) solve();
}