#include<bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp> //required
#include <ext/pb_ds/tree_policy.hpp> //required

using namespace __gnu_pbds; 
using namespace std;

template <typename T> using ordered_set =  tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; 
// find_by_order(k)  returns iterator to kth element starting from 0;
// order_of_key(k) returns count of elements strictly smaller than k;
typedef int  ll;
typedef vector<ll> VL;
typedef vector<int> VI;
typedef pair<ll,ll> PLL;
typedef pair<int,int> PII;
#define pb push_back

#define F first
#define S second
#define SZ(a) int((a).size())
#define ALL(a) a.begin(),a.end()
#define fr(i,x,y) for(int i=x;i<y;i++)
#define frr(i,x,y) for(int i=x-1;i>=y;i--)
//#define inf 1e18+1
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const int mod=1000000007;
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
ll power(ll a,ll b){ll ans=1;while(b!=0){if(b&1){ans*=a;}a=a*a;b>>=1;}return ans;}
ll powerm(ll a,ll b){ll ans=1;while(b!=0){if(b&1){ans*=a;ans%=mod;}a=a*a;a%=mod;b>>=1;}return ans%mod;}
// string to integer stoi()
// string to long long stoll()
// string.substr(position,length);
// integer to string to_string();

void solve()
{
    ll n;
    cin>>n;
    ll gd=0;
    VL arr(n);
    VL mp(1e6+5,0);
    ll even=0;
    fr(i,0,n)
    {
        cin>>arr[i];
        gd=gcd(gd,arr[i]);
        mp[arr[i]]+=1;
        if(arr[i]%2==0)
        {
            even++;
        }
    }
    if(gd>1)
    {
        cout<<"not coprime\n";
        return;
    }
    if(even>1)
    {
        cout<<"setwise coprime\n";
        return;
    }
    VL prime(1e6+5,0);
    for(int i=2;i<=1e6;i++)
    {
        if(prime[i]==0)
        {
            ll ct=0;
            for(int j=i;j<=1e6;j+=i)
            {
                if(mp[j]>0)
                {
                    ct+=mp[j];
                }
                prime[j]=2;
            }
            if(ct>1)
            {
                cout<<"setwise coprime\n";
                return;
            }
            prime[i]=1;
        }
    }
    // VL val(1e6+5,0);
    // fr(i,0,n)
    // {
    //     if(mp[arr[i]]>1)
    //     {
    //         cout<<"setwise coprime\n";
    //         return;
    //     }
    //     if(prime[arr[i]]==1)
    //     {
    //         continue;
    //     }
    //     for(int j=1;j*j<=arr[i];j++)
    //     {
    //         if(arr[i]%j==0)
    //         {
    //             // if(mp[j]>0||mp[arr[i]/j]>0)
    //             // {
    //             //     //cout<<arr[i]<<" "<<j<<" "<<
    //             //     cout<<"setwise coprime\n";
    //             //     return;
    //             // }
    //             val[j]++;
    //             if(j!=arr[i]/j)
    //             {
    //                 val[arr[i]/j]++;
    //             }
    //         }
    //     }
    // }
    // fr(i,2,1e6+1)
    // {
    //     if(val[i]>1)
    //     {
    //         cout<<"setwise coprime\n";
    //         return;
    //     }
    // }
    cout<<"pairwise coprime\n";
    return;
}
int main()
{
    IOS;
    ll t=1;
    //cin>>t;
    while(t--)
    {
        //cout<<"Case #"<<pp-t<<":\n";
        solve();
    }
    return 0;
}
/* stuff you should look for
        * int overflow, array bounds
        * special cases (n=1?)
        * do smth instead of nothing and stay organized
        * WRITE STUFF DOWN
*/
/*
recursion - matrix exponential

*/
// BITMASK:
// 1)When some constrall is of the order of 15-20, think of bitmask DP.
// 2)When some constrall is around 40, try out meet in the middle
// 3) See Strings,palindromes,prefix,suffix etc -> KMP,Z algorithm

Measured memory_bytes: 15072