#include <bits/stdc++.h>
#pragma GCC optimize(3)
using namespace std;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int n, x, num[1000005], ok = 1, g;
int main() {
  cin >> n;
  for (int i = 0; i < n; ++i) {
    scanf("%d", &x);
    ++num[x];
    g = gcd(x, g);
  }
  for (int i = 2; i <= 1000; ++i) {
    int tot = 0;
    for (int j = i * i; j <= 1000000; j += i) tot += num[j];
    if (tot > 1) {
      ok = 0;
      break;
    }
  }
  if (ok)
    cout << "pairwise coprime";
  else if (g == 1)
    cout << "setwise coprime";
  else
    cout << "not coprime";
  return 0;
}
