#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please


int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);


	int N;
	cin >> N;
	int A[1000001];
	rep1(i, N) {
		cin >> A[i];
	}

	int kari = A[0];
	rep1(i, N) {
		kari = __gcd(kari, A[i]);
	}

	if (kari != 1) {
		co("not coprime");
		return 0;
	}

	unordered_map<int, int> MP;
	rep1(i, N) {
		int sq = sqrt(A[i]);

		int tmp = A[i];
		for (int j = 2; j <= sq; j++) {
			while (tmp % j == 0) {
				tmp /= j;

				if (MP[j] && MP[j] < i) {
					co("setwise coprime");
					return 0;
				}
				MP[j] = i;
			}
		}
	}
	co("pairwise coprime");



	Would you please return 0;
}