#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds; 
#define fio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#pragma GCC optimize "trapv"
#define _GLIBCXX_DEBUG
#define ll long long int
#define ld long double
#define ull unsigned long long int  // ranges from (0 - twice of long long int)
#define rep(i,a,n) for (ll i=a;i<n;i++)
#define per(i,a,n) for (ll i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define vll vector<ll>
#define mod 1000000007LL
#define llpair pair<ll,ll>
#define INF 1000000000000000000ll
#define np next_permutation
#define PI acos(-1)
#define deb(x) cout<<#x<<" "<<x<<endl;
#define rotate_left(vec,amt) rotate(vec.begin(),vec.begin()+amt,vec.end());
#define rotate_right(vec,amt) rotate(vec.begin(),vec.begin()+vec.size()-amt,vec.end());
#define all(x) x.begin(),x.end()
#define sortall(x) sort(all(x))
#define clr(x) memset(x,0,sizeof(x))
typedef tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> pbds;
//ALWAYS USE ll DATA TYPE FOR INTEGER(FASTER THAN INTEGER AS WELL AS SOMETIMES WITHOUT USE LONG UR ANSWER WILL NOT ACCEPTED) && DOUBLE FOR DECIMAL VALUE
 
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }
 
    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};
 
bool isPerfectSquare(long double x)
{
  //long double sr = sqrt(x);
  //return ((sr - floor(sr)) == 0);
  return (ceil(sqrt(x))==floor(sqrt(x)));
 
}
 
bool isprime(ll n)  //IN  O(sqrt(n))
{
    if(n<=1) return false;
    for(ll i=2;i*i<=n;i++)
        if(n%i==0)
            return false;
 
    return true;
}
 
void prime_factors(ll n)
{
	
	for(ll i=2;i*i<=n;i++)
	{
		
		if(n%i==0)
		{
			ll count=0;
			while(n%i==0)
			{
				count++;
				n=n/i;
			}
			
			cout<<i<<" "<<"^"<<" "<<count<<"\n";
		}
		
	}
	if(n>1)
	cout<<n<<" "<<"^"<<" "<<1<<"\n";
}
 
 
vector<ll> divisors(ll n){    //IN  O(sqrt(n))
 
    vll v;
    for(ll i=1;i*i<=n;i++)
    {
        if(n%i==0)
        {
            v.pb(i);
            if((n/i)!=i)
            v.pb(n/i);
        }
    }
    return v;
}
 
 
 
ll power(ll a, ll n)  // using Binary Exponential in TC O(logn)
{                     // Self Written By </ME> :)
    ll res=1;
    while(n)
    {
        if(n%2) 
        res=(res*a) ,n--;
        else
        a=(a*a) ,n/=2;
    }
    return res;
}
 
 
ll ts(ll arr[],int l,int r,int x) // ternary search to find x in sorted array arr
{
    
    while(l<=r)
    {
        ll mid1= l+(r-l)/3;
        ll mid2= r -(r-l)/3;
        if(arr[mid1]==x || arr[mid2]==x)
            return 1;
        if(x<arr[mid1])
            r=mid1-1;
        else if(x>arr[mid2])
            l=mid2+1;
        else
        {
            l=mid1+1;
            r=mid2-1;
        }
    }
 
    return -1;
}
 
 //USE ONLY CASE OF MODULAR EXPONENTIAL
ll power(ll a, ll n, ll m)  // using Binary Exponential in TC O(logn)
{                     // Self Written By </ME> :)
    ll res=1;
    while(n)
    {
        if(n%2) 
        res=(res*a)%m ,n--;
        else
        a=(a*a)%m ,n/=2;
    }
    return res;
}
 
 
ll modulo_inverse(ll a, ll m)   // using little fermat theorem // Work in log(n) Time Complexity
{
	 //Note:-> For calculating the modular inverse use power(a,m-2,m) as parameters values 
	 //(condition is m should be prime and m & a must be coprime.)
	ll res=power(a,m-2,m); 
	return res;
}
 
 
 
 
ll Extended_gcd(ll a, ll b, ll &x, ll &y)   // Simple Use is to find the coefficients of a,b if ax + by = gcd(a,b) is satisfying...:)
{
	if(b==0)
	{
		x=1;
		y=0; return a;
	}
	
	ll x1,y1;
	ll g = Extended_gcd(b,a%b,x1,y1);
	
	// value we get here
	x= y1;
	y= x1 - (a/b)*y1;
	
	return g;
}
 
vector<ll> count_freq(string &str ,string &substr)
{
	 //This code is used to count the frequency of particular substring in a given string using the found function
	vector<ll>pos;
	size_t found = str.find(substr,0);
	while(found!=string::npos)
	{
		pos.pb(found);    // position storing is 0 based indexing add 1 if required 1 based indexing.
		found=str.find(substr,found+1);
		
	}
	
	return pos;
	
}
 
string decTobin(ll n)
{
	string s;
	while(n)
	{
		n%2==1?s.pb('1'):s.pb('0');
		n=n>>1;
	}
	reverse(s.begin(),s.end());
	return s;
}
 
ll binTodec(string s)// Please Note that Capable to converting upto Binary number within (10^18) Value, Use unsigned ll for more high conversion.
{
	ll res=0;
	ll n=s.length();
	for(ll i=s.length()-1;i>=0;i--)
	{
		if(s[i]=='1')
		res+=power(2,n-i-1);   // using binary exponential
	}
	return res;
}
 
 
 
/*   1.   Binary/Hexa/Octa to interger or decimal ->>>>>>  int d =stoi(s,nullptr,2); 
 
  
  	 2.	  Now Another is Decimal/Interger to Binary->>>>>  string k =bitset<32>(128).to_string();  
  	  
  	 3.   Distance function is used to calculate the distance between the 2 position of the itterator in c++ STL
 */
 
 
// It doesn't matter how Slowly you go,as long as you do not stop.
// I Just want to Enjoy and improve my Problem Solving.
// Rating Always must be Like HEARTBEAT i.e., If it stops fluctuating it means {YOU ARE DEAD!!!!!}.
// PLEASE READ THE QUESTION CAREFULLY, AND PLEASE GIVE 100% ATTENTION WHILE WRITING YOUR CODE.
 
// YOU DON'T HAVE TO BE GREAT TO START,
//BUT HAVE TO START TO BE GREAT.



int findMaxGCD(ll arr[], ll n) 
{ 
    // Computing highest element 
    ll high = 0; 
    for (int i = 0; i < n; i++) 
        high = max(high, arr[i]); 
  
    // Array to store the count of divisors 
    // i.e. Potential GCDs 
    int divisors[high + 1] = { 0 }; 
  
    // Iterating over every element 
    for (int i = 0; i < n; i++) 
    { 
        // Calculating all the divisors 
        for (int j = 1; j <= sqrt(arr[i]); j++) 
        { 
            // Divisor found 
            if (arr[i] % j == 0) 
            { 
                // Incrementing count for divisor 
                divisors[j]++; 
  
                // Element/divisor is also a divisor 
                // Checking if both divisors are 
                // not same 
                if (j != arr[i] / j) 
                    divisors[arr[i] / j]++; 
            } 
        } 
    } 
  
    // Checking the highest potential GCD 
    for (int i = high; i >= 1; i--) 
    {
		 if (divisors[i] > 1) 
            return i;
	}
	
	return 1;     
}







ll seive[1000005];

int main() {
    auto start = chrono::high_resolution_clock::now();
    fio;
    ll t=1; 
    //cin>>t;
    memset(seive,-1,sizeof(seive));
    seive[0]=seive[1]=1;
    for(int i=2;i<1000005;i++)
    {
		if(seive[i]==-1) // it means i is prime number so make all there factors i
		{
			for(int j=i;j<1000005;j=j+i)
			{
				if(seive[j]==-1)
				seive[j]=i; // only one time update
			}
			
		}
	}
    
    
    while(t--)
    {
		ll n; cin>>n;
		ll arr[n]; rep(i,0,n) cin>>arr[i];
		
		
		//for(int i=1;i<=10;i++)
		//cout<<seive[i]<<" ";
		//cout<<"\n";
		
		
		unordered_set<ll,custom_hash>st;
		bool flag=true;
		int mgcd=findMaxGCD(arr,n);
		if(mgcd>1)
		flag=false;
		
		if(flag)
		cout<<"pairwise coprime"<<"\n";
		else
		{
			
			ll g=arr[0];
			for(int i=1;i<n;i++)
			g=__gcd(g,arr[i]);
			
			if(g==1)
			cout<<"setwise coprime"<<"\n";
			else
			{
				
				// nothing 
				cout<<"not coprime"<<"\n";
				
				
			}
			
			
			
		}
		
		
	}
    auto finish = chrono::high_resolution_clock::now();
    cerr << "Time elapsed: " << (chrono::duration<long double>(finish-start)).count() << "s\n";
    return 0;
            
}



































