#include <bits/stdc++.h>
using namespace std;
template <class T, class U>
bool contains(const T& vec, const U& value) {
  return vec.find(value) != vec.end();
}
long long gcd(long long a, long long b);
long long gcd(long long a, long long b) {
  if (a < b) {
    return gcd(b, a);
  }
  long long r;
  while (r = a % b) {
    a = b;
    b = r;
  }
  return b;
}
long long 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};
set<long long> factor(long long x) {
  set<long long> result;
  for (long long i = 0;
       i < sizeof(primes) / sizeof(primes[0]) && primes[i] * primes[i] <= x;
       ++i) {
    if (x % primes[i] != 0) {
      continue;
    }
    result.insert(primes[i]);
    while (x % primes[i] == 0) {
      x /= primes[i];
    }
    if (x == 1) {
      break;
    }
  }
  if (x != 1) {
    result.insert(x);
  }
  return result;
}
int main() {
  long long n;
  cin >> n;
  vector<long long> a(n);
  for (long long i = 0; i < (n); ++i) {
    cin >> a[i];
  }
  set<long long> lcm;
  set<long long>* gcd = nullptr;
  bool flg_lcm = true;
  for (long long i = 0; i < (n); ++i) {
    auto fs = factor(a[i]);
    if (flg_lcm) {
      for (auto it = (fs).begin(); it != (fs).end(); ++it) {
        if (contains(lcm, *it)) {
          flg_lcm = false;
        } else {
          lcm.insert(*it);
        }
      }
    }
    if (gcd) {
      if (gcd->size() > 0) {
        for (auto it = (fs).begin(); it != (fs).end(); ++it) {
          gcd->erase(*it);
        }
      }
    } else {
      gcd = new set<long long>(fs);
    }
  }
  if (flg_lcm) {
    cout << "pairwise coprime" << endl;
  } else if (gcd && gcd->size() == 0) {
    cout << "setwise coprime" << endl;
  } else {
    cout << "not coprime" << endl;
  }
  return 0;
}
