#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(int i=0; i<n; i++)
#define REPR(i, n) for(int i=n-1; i>=0; i--)
#define FOR(i, m, n) for(int i=m; i<n; i++)
#define ALL(v) v.begin(), v.end()
#define SIZE(x) ll(x.size()) 
using P = pair<int, int>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = 2e9;
const ll LINF = (1LL<<60);

int main()
{
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n; cin >> n;
  vector<ll> a(n);
  REP(i,n) cin >> a[i];

  ll g = a[0];
  ll l = a[0];
  ll tm = a[0];
  FOR(i,1,n){
    g = gcd(g, a[i]);
    l = lcm(l, a[i]);
    tm *= a[i];
  }
  if(l==tm) cout << "pairwise coprime\n";
  else if(g==1) cout << "setwise coprime\n";
  else cout << "not coprime\n";

  return 0;
}
