#include <bits/stdc++.h>
using namespace std;
using ii = pair<int, int>;
using vi = vector<int>;
const int N = 1e5 + 5, MOD = 1e9 + 7, INF = 1e9 + 5;
int gcd(int a, int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
signed main() {
  ios_base::sync_with_stdio(false), cin.tie(nullptr);
  int n;
  cin >> n;
  int a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  int ans = gcd(a[0], a[1]);
  bool pairwise = true, setwise = true;
  for (int i = 2; i < n; i++) {
    if (ans != 1) pairwise = false;
    ans = gcd(ans, a[i]);
  }
  if (ans != 1) setwise = false;
  if (pairwise)
    cout << "parwise coprime";
  else if (setwise)
    cout << "setwise coprime";
  else
    cout << "not coprime";
}
