#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  vector<int> a(n);
  int min = 0;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    if (a[min] > a[i]) {
      min = i;
    }
  }
  vector<bool> yakusu(a[min] + 1, true);
  yakusu[0] = false;
  yakusu[1] = false;
  int i = 2;
  while (i <= a[i]) {
    if (yakusu[i]) {
      int count = 0;
      for (int j = 0; j < n; j++) {
        if (a[j] % i == 0) {
          count++;
        }
      }
      if (count == n) {
        cout << "not conprime" << endl;
        return 0;
      }
      if (count >= 2) {
        cout << "setwise coprime" << endl;
        return 0;
      }
      for (int k = 1; k * i <= a[min]; k++) {
        yakusu[k * i] = false;
      }
    }
    i++;
  }
  cout << "pairwise coprime" << endl;
  return 0;
}
