#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<ll,ll> ii;
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define FOR(i,j,n,m) for(int i=j;i<n;i+=m)
#define RST(i,n) memset(i,n,sizeof i)
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(),a.end()
#define X first
#define Y second
#define mkp make_pair
#define pb push_back
#define pob pop_back
#ifdef cold66
#define debug(...) do{\
    fprintf(stderr,"%s - %d (%s) = ",__PRETTY_FUNCTION__,__LINE__,#__VA_ARGS__);\
    _do(__VA_ARGS__);\
}while(0)
template<typename T>void _do(T &&_x){cerr<<_x<<endl;}
template<typename T,typename ...S> void _do(T &&_x,S &&..._t){cerr<<_x<<" ,";_do(_t...);}
template<typename _a,typename _b> ostream& operator << (ostream &_s,const pair<_a,_b> &_p){return _s<<"("<<_p.F<<","<<_p.S<<")";}
template<typename It> ostream& _OUTC(ostream &_s,It _ita,It _itb)
{
    _s<<"{";
    for(It _it=_ita;_it!=_itb;_it++)
    {
        _s<<(_it==_ita?"":",")<<*_it;
    }
    _s<<"}";
    return _s;
}
template<typename _a> ostream &operator << (ostream &_s,vector<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,set<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a,typename _b> ostream &operator << (ostream &_s,map<_a,_b> &_c){return _OUTC(_s,ALL(_c));}
template<typename _t> void pary(_t _a,_t _b){_OUTC(cerr,_a,_b);cerr<<endl;}
#define IOS()
#else
#define debug(...)
#define pary(...)
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#endif // cold66
//}

template<class T> inline bool chkmax(T &a, const T &b) { return b > a ? a = b, true : false; }
template<class T> inline bool chkmin(T &a, const T &b) { return b < a ? a = b, true : false; }
template<class T> using MaxHeap = priority_queue<T>;
template<class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;

const ll MAXn=1e6+5,MAXlg=__lg(MAXn)+2;
const ll MOD=1000000007;
const ll INF=(ll)1e18;

int ok[1001];
vector<int> prime;
int d[MAXn];
int cnt[MAXn];
int main(){
  IOS();
  for(int i=2;i<1001;i++){
    if(!ok[i]) prime.pb(i);
    for(int j=0;i*prime[j]<1001;j++){
      ok[i*prime[j]] = true;
      if(i%prime[j]==0) break;
    }
  }
  int n;
  cin >> n;
  int gcd = -1;
  for (int i=0;i<n;++i) {
    cin >> d[i];
    if (gcd == -1) gcd = d[i];
    else gcd = __gcd(gcd,d[i]);
  }
  if (gcd != 1) return cout << "not coprime" << endl,0;
  for (auto p:prime) {
      int tmp = 0;
      for (int i=0;i<n;++i) {
          if (d[i] % p == 0) {
              tmp++;
              while (d[i] % p == 0) {
                  d[i] /= p;
              }
          }
      }
      if (tmp >= 2) return cout << "setwise coprime" << endl,0;
  }

  for (int i=0;i<n;++i) {
      if (cnt[d[i]] == 1) continue;
      if (cnt[d[i]] != 0) return cout << "setwise coprime" << endl,0;
      cnt[d[i]]++;
  }
  cout << "pairwise coprime" << endl;
}

