#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define speed                     \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define ll long long
#define pb push_back
#define mem1(a) memset(a, -1, sizeof(a))
#define mem0(a) memset(a, 0, sizeof(a))
#define endl "\n"
#define mod 1000000007
#define mod1 998244353
#define ff first
#define ss second
#define MAX 500005
#define N 300005
#define INF 1000000009
#define all(v) v.begin(), v.end()
#define sbit(a) __builtin_popcount(a)
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef pair<ll, ll> pll;
typedef pair<pll, ll> ppl;
typedef map<ll, ll> mpll;
typedef map<vector<ll>, ll> mpvl;
ll power(ll x, ll y, ll p)
{
    ll res = 1;

    x = x % p;

    if (x == 0)
        return 0;
    while (y > 0)
    {

        if (y & 1)
            res = (res * x) % p;

        y = y >> 1;
        x = (x * x) % p;
    }

    return res;
}

void solve()
{
    ll n;
    cin >> n;
    vector<ll> a(n);
    ll gc;
    for (ll i = 0; i < n; i++)
    {
        cin >> a[i];
        if (i)
            gc = __gcd(gc, a[i]);
        else
            gc = a[i];
    }
    bool f = 0;
    map<ll, ll> mp;
    for (ll i = 0; i < n; i++)
    {
        ll tmp = a[i];
        while (!(tmp % 2))
        {
            tmp = tmp / 2;
            if (mp[2])
            {
                f = 1;
              
            }
              mp[2]++;
        }
        for (ll j = 3; j * j < tmp; j++)
        {
            while (tmp % j == 0)
            {
                tmp = tmp / j;
                if (mp[j])
                {
                    f = 1;
                    
                }
                mp[j]++;
            }
        }
        if (tmp > 2)
        { 
            tmp=tmp/tmp;
            if (mp[tmp])
            {
                f = 1;
               
            }
             mp[tmp]++;
        }
    }
 //   cout<<f<<endl;
    if(!f)
    {
        cout<<"pairwise coprime"<<endl;
    }
    else if(gc==1)
    {
        cout<<"setwise coprime"<<endl;
    }
    else
    {
        cout<<"not coprime"<<endl;
    }
    
}

int main()
{

    speed;

    ll kk;
    kk = 1;
    // cin >> kk;
    while (kk--)
    {

        solve();
    }
    return 0;
}