#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (a < b) {
    swap(a, b);
  }
  if (a % b == 0) {
    return b;
  }
  return gcd(b, a % b);
}
vector<bool> sieve(long long n) {
  vector<bool> result(n + 1, true);
  for (long long i = 2; i < result.size(); ++i) {
    if (result[i]) {
      for (long long j = 2; j * i < result.size(); ++j) {
        result[j * i] = false;
      }
    }
  }
  return result;
}
int32_t main() {
  vector<int32_t> primes = {
      2,   3,   5,   7,   11,  13,  17,  19,  23,  29,  31,  37,  41,  43,
      47,  53,  59,  61,  67,  71,  73,  79,  83,  89,  97,  101, 103, 107,
      109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181,
      191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263,
      269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349,
      353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433,
      439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521,
      523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613,
      617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701,
      709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809,
      811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887,
      907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997};
  long long n;
  cin >> n;
  vector<long long> numbers;
  numbers.reserve(n);
  for (long long i = 0; i < n; ++i) {
    long long number;
    cin >> number;
    numbers.push_back(number);
  }
  long long current_gcd = numbers[0];
  for (auto i : numbers) {
    current_gcd = gcd(i, current_gcd);
  }
  bool setwise = current_gcd == 1;
  unordered_set<long long> in;
  bool pairwise = true;
  for (long long i = 0; i < numbers.size(); ++i) {
    bool end_cycle = false;
    for (auto prime : primes) {
      if (numbers[i] < prime) {
        break;
      }
      if (numbers[i] % prime == 0) {
        if (in.count(prime)) {
          pairwise = false;
          end_cycle = true;
          break;
        }
        in.insert(prime);
      }
    }
    if (end_cycle) {
      break;
    }
  }
  if (pairwise) {
    cout << "pairwise coprime";
  } else if (setwise) {
    cout << "setwise coprime";
  } else {
    cout << "not coprime";
  }
  return 0;
}
