#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
int main() {
  int n;
  cin >> n;
  static int a[1000001] = {0};
  int mxa = 0;
  for (int i = 0; i < (n); i++) {
    int b;
    cin >> b;
    mxa = max(mxa, b);
    a[b] = 1;
  }
  bool flag1 = 1;
  bool flag2 = 1;
  for (int i = 2; i <= sqrt(mxa); i++) {
    int cnt = 0;
    for (int j = 1; i * j <= mxa; j++) {
      if (a[i * j] == 1) cnt++;
      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;
}
