/*

                         YATIN KWATRA                   _03_08_14


Let's Hoop..

------------------------------------------------

           o
 /|   o         o
 \|=--            o
    ##
                    \\
                 /   \O
                O_/   T
                T    /|
                |\  | |
 _______________|_|________

------------------------------------------------

o- - -  \o          __|
   o/   /|          vv`\
  /|     |              |
   |    / \_            |
  / \   |               |
 /  |                   |


------------------------------------------------

HOOPER_4_LYF..

*/

// AC BAKSHI RABBA

// #pragma GCC optimize "trapv"

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define ll                      long long
#define int                     ll
#define FIO                     ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pbds                    tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ld                      long double
#define ull                     unsigned long long
#define endl                    "\n"
#define fo(i,a,b)               for(int i = a; i<=b ; i++)
#define rfo(i,a,b)              for(int i = a; i>=b ; i--)
#define vii                     vector<int>
#define vll                     vector<ll>
#define pq                      priority_queue
#define uom                     unordered_map
#define all(v)                  v.begin(),v.end()
#define mp                      make_pair
#define pb                      push_back
#define pob                     pop_back
#define ff                      first
#define ss                      second
#define pii                     pair<int,int>
#define pll                     pair<ll,ll>
#define mll                     map<ll,ll>
#define mii                     map<int,int>
#define vvii                    vector<vii>
#define vvll                    vector<vll>
#define mod                     1000000007
#define MIN                     -1e9
#define pi                      3.1415926535897932384626433832795

using namespace std;
using namespace __gnu_pbds;

void INPUT()
{
#ifndef ONLINE_JUDGE
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
#endif
}

/*
----------------------------------------------------------------

   -> Check For Overflows
   -> Out of Bounds
   -> Initialisations of global arrays and variables
   -> Read the Question and the sample test cases carefully
   -> Its not Always Complex, Try to simplify
   -> write it down and try to solve
   -> Have Faith in urself and in ur approach
   -> If it seems totally out of reach, switch to next :)
   -> And Come Back later, if possible ..

----------------------------------------------------------------*/

const int N = 1e6 + 1;

int prime[N];
int cnt[N];

void comp()
{
  fo(i, 1, N - 1) prime[i] = i;

  fo(i, 2, N - 1)
  {
    if (prime[i] == i)
    {
      for (int j = 2 * i; j < N; j += i) prime[j] = i;
    }
  }
}

void solve()
{

  int n, x;
  cin >> n;

  comp();

  vii v(n);

  fo(i, 0, n - 1) cin >> v[i];

  string a1 = "pairwise coprime";
  string a2 = "setwise coprime";
  string a3 = "not coprime";

  int g = v[0];
  fo(i, 1, n - 1) g = __gcd(g, v[i]);

  int ok = 1;

  fo(i, 0, N - 1) cnt[i] = 0;

  fo(i, 0, n - 1)
  {
    x = v[i];

    set<int>s;

    while (x ^ 1)
    {
      s.insert(prime[x]);
      x /= prime[x];
    }

    bool found = 1;

    for (auto &j : s)
    {
      if (cnt[j] > 0) found = 0;
      cnt[j]++;
    }

    if (i == 0) continue;

    if (!found)
    {
      ok = 0;
      break;
    }

  }

  if (ok) cout << a1 << endl;
  else if (!ok and g == 1) cout << a2 << endl;
  else cout << a3 << endl;

}

signed main() {

  FIO
  INPUT();

  int t;
  t = 1;
// cin >> t;

  fo(i, 0, t - 1)
  {
    solve();
  }
  return 0;
}

Measured memory_bytes: 26700