#include<bits/stdc++.h>
using namespace std;
#define ll long long int
ll gcd(int a,int b)
{
    if(b==0)
        return a;
    return gcd(b,a%b);
}
ll cnt[1000009];
int main()
{
   long long int a[100000],p=0,i,j;

   int n;
   ll ans=0;
   cin>>n;
   long long int b[n+9];
   for( i=0;i<n;i++){
        cin>>p;
        cnt[p]++;
        ans=gcd(ans,p);
   }
 if(ans>1) cout<<"not coprime"<<endl;

 else{  ll x=0;
       for(i=2;i<=1000000;i++){
          x=0;
        for(j=i;j<=1000000;j+=i){
              x+=cnt[j];

        }
        if(x>1) break;

       }


   if(x>1)cout<<"setwise coprime"<<endl;
   else cout<<"pairwise coprime"<<endl;
 }
}




