#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];
    	multiset <int> ms;
    		
    	for(int i=0;i<n;i++)
    	{
    		cin>>a[i];
    		if(i)
    		ms.insert(a[i]);
    	}
    	
    	int totgcd=__gcd(a[0],a[1]);
    	for(int i=2;i<n;i++)
    	{
    		totgcd=__gcd(totgcd,a[i]);
    	}

    	
    	string ans="pairwise coprime";
    	for(int i=0;i<n-1;i++)
		{
			int x=a[i];
			for(int j=2;j*j<=a[i];j++)
			{
				if(a[i]%j==0 )
				{
					if(ms.find(j)!=ms.end() || ms.find(a[i]/j)!=ms.end())
					ans="setwise coprime";
				}
				
				// while(x%j==0)
				// 	x=x/j;
				// if(x==1)

			}
			ms.erase(ms.find(a[i+1]));
			
				
		}
		
    	if(totgcd==1)
    		cout<<ans;
    	else 
    		cout<<"not coprime";
    }
}
