#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define pii pair<int,int>
#define F first
#define S second
#define pb push_back
int mod1=998244353,mod2=(int)1e9+7;
int power(int n,int k,int mod){int ans=1; n=n%mod;while(k>0){if(k&1)ans=(ans*n)%mod;n=(n*n)%mod;k>>=1;}return (ans+mod)%mod;}//negative nos & 0^0
struct triplet{int a,b,c;};bool operator < (const triplet &t1,const triplet &t2){if(t1.a<t2.a)return true;if(t1.a==t2.a && t1.b <t2.b)return true;if(t1.a==t2.a && t1.b ==t2.b && t1.c<t2.c)return true;return false;}

int32_t main()
{

	fio;
	#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
	#endif
	
	 int t=1; 
	 // cin>>t;
    while(t--)
    {
    	int n;
    	cin>>n;
    	int a[n];
    	
    	for(int i=0;i<n;i++)
    	{
    		cin>>a[i];
    		
    	}
    		
    	for(int i=n-2;i>=0;i--)
    	{
    		a[i]=__gcd(a[i+1],a[i]);
    	}
    	string ans="pairwise coprime";
    	for(int i=0;i<n-1;i++)
    		{
    			if(a[i]!=1)
    				ans="setwise coprime";
    		}
    	if(a[0]==1)
    		cout<<ans;
    	else
    		cout<<"not coprime";
    }
}
