#include<bits/stdc++.h>
using namespace std;

template <typename A, typename B>
string to_string(pair<A, B> p);
 
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
 
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
 
string to_string(const string& s) {
  return '"' + s + '"';
}
 
string to_string(const char* s) {
  return to_string((string) s);
}
 
string to_string(bool b) {
  return (b ? "true" : "false");
}
 
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
 
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}
 
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
 
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
 
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
 
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

#define ar array<ll, 2>
#define ll long long
#define in insert
#define pb push_back
#define vt vector
#define P_Q(x) priority_queue<x>
#define p_q(x) priority_queue<x, vector<x>, greater<x>>
#define For(i, n) for(int i = 0; i < n; i++)
#define Rev(i, n) for(int i = n-1; i >= 0; i--)
#define FOR(i, n) for(int i = 1; i <= n; i++) 
#define REV(i, n) for(int i = n; i >= 1; i--)
#define Rep(i,a,b) for(int i = a; i <= b; i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int) (x).size()

#define CERR cout
// #define CERR cerr
 
void debug_out() { CERR << endl; }
 
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  CERR << " " << to_string(H);
  debug_out(T...);
}
 
#ifndef ONLINE_JUDGE
#define dbg(...) CERR << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define dbg(...) 42
#endif
 
const ll mod = 1e9L + 7;
const ll INF = 1e18L + 5;
const ll mxN = 1e6 + 1;
ll n;
vt<ll> a(mxN), prime(mxN), lpf(mxN);

void sieve()
{
    prime[0] = prime[1] = 0;
    Rep(i,2,mxN-1) prime[i] = 1;
    Rep(i,2,mxN-1)
    {
        if(!prime[i]) continue;
        for(int j = i; j < mxN; j+=i)
        {
            prime[j] = 0;
            lpf[j] = i;
        }
        prime[i] = 1;
    }
}

void solve()
{
    cin >> n;
    For(i, n) cin >> a[i];
    sieve();
    map<int, int> mp;
    ll G = a[0];
    For(i, n) G = __gcd(G, a[i]);
    bool ok = 1;
    for(int num: a)
    {
        set<int> s;
        while(num > 1)
        {
            s.in(lpf[num]);
            num /= lpf[num];
        }
        for(int x: s)
        {
            if(mp[x])
            {
                ok = 0;
                break;
            }
            mp[x] = 1;
        }
    }
    if(ok)
        cout << "pairwise coprime";
    else if(G == 1)
        cout << "setwise coprime";
    else
        cout << "not coprime";
}
 
int main()
{

#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    
    ios::sync_with_stdio(0);  cin.tie(0);
    ll t = 1;
    // cin >> t;

    while(t--)
    {
        solve();
    } 
    return 0;
}

Measured memory_bytes: 30360