#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const long long  mod = 1000000007;


int main(){
  int n;
  cin >> n;

  vector<int> a(1000001,0);
  rep(i,n) {
    int A;
    cin >> A;
    a[A] += 1;
  }

  //pairwise
  bool flag1 = 1;
  //setwise
  bool flag2 = 1;

  for(int i = 2; i <= 1000000; i++){
    int cnt = 0;
    for(int j = i; j <= 1000000; j += i){
      if(a[j] > 0) cnt += a[j];
    }
    if(cnt >= 2) flag1 = 0;
    if(cnt == n) flag2 = 0;
  }
  
  if(flag1) cout << "pairwise coprime" << endl;
  else if (flag2) cout << "setwise coprime" << endl;
  else cout << "not coprime" << endl;
  
 }
