#include <bits/stdc++.h>
int main() {
  int gcd(int, int);
  int n, count = 0;
  scanf("%d", &n);
  int A[n];
  for (int i = 0; i < n; i++) {
    scanf("%d", &A[i]);
  }
  for (int i = 0; i < n - 1; i++) {
    for (int j = i + 1; j < n; j++) {
      if (gcd(A[i], A[j]) != 1) {
        count++;
      }
    }
  }
  if (count != 0)
    printf("not coprime");
  else
    printf("setwise coprime");
}
int gcd(int a, int b) {
  if (a > b) {
    for (int i = b; i > 0; i--) {
      if (a % i == 0 && b % i == 0) return i;
    }
  } else {
    for (int i = a; i > 0; i--) {
      if (a % i == 0 && b % i == 0) return i;
    }
  }
}
