#include <bits/stdc++.h>
using namespace std;
int nums[1000010], check[1000010], check2[1000010];
bool tempList[1000001];
vector<int> prime;
int gcd(int n, int b) {
  if (n < b) {
    swap(n, b);
  }
  if (b == 0) {
    return n;
  }
  return gcd(b, n % b);
}
int main() {
  tempList[0] = true;
  tempList[1] = true;
  for (int i = 2; i <= 1000000; i++) {
    if (!tempList[i]) {
      prime.push_back(i);
      int cnt = i * 2;
      while (cnt <= 1000000) {
        tempList[cnt] = true;
        cnt += i;
      }
    }
  }
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &nums[i]);
  }
  sort(nums, nums + n);
  int gcdVnl = nums[0];
  for (int i = 0; i < n; i++) {
    if (gcdVnl == 1) {
      break;
    }
    gcdVnl = gcd(gcdVnl, nums[i]);
  }
  if (gcdVnl != 1) {
    printf("not coprime");
    return 0;
  }
  for (int i = 0; prime[i] <= 1000; i++) {
    for (int j = 0; j < n; j++) {
      if (!(nums[j] % prime[i])) {
        check[nums[j]]++;
        if (check[nums[j]] > 1) {
          printf("setwise coprime");
          return 0;
        }
        while (!(nums[i] % prime[i])) {
          nums[i] /= prime[i];
        }
      }
    }
  }
  for (int i = 0; i < n; i++) check2[nums[i]]++;
  for (int i = 2; i <= 1000000; i++) {
    if (check2[i] > 1) {
      printf("setwise coprime");
      return 0;
    }
  }
  printf("pairwise coprime");
  return 0;
}
