local read = io.read
local max = math.max
local min = math.min
local insert = table.insert

local n = read("n")

local a_max = 0
local a_t = {}
for i = 1, n do
	local a_i = read("n")
	a_t[i] = a_i
	a_max = max(a_i, a_max)
end

local dust_t = {}
for i = 2, a_max do
	if dust_t[i] == nil then
		local j = 2 * i
		while j <= a_max do
			if dust_t[j] == nil then
				dust_t[j] = i
			end
			j = j + i
		end
	end
end

local is_pairwise_coprime = true
local prime_factor_t = {}
for i = 1, n do
	local divided = a_t[i]
	local a_i_prime_t = {}
	while true do
		if prime_factor_t[divided] then
			is_pairwise_coprime = false
			break
		elseif dust_t[divided] then
			insert(a_i_prime_t, divided)
			insert(a_i_prime_t, dust_t[divided])
			divided = divided // dust_t[divided]
		else
			a_i_prime_t[divided] = true
			insert(a_i_prime_t, divided)
			break
		end
	end
	for j = 1, #a_i_prime_t do
		prime_factor_t[a_i_prime_t[j]] = true
	end
	if not is_pairwise_coprime then
		break
	end
end

if is_pairwise_coprime then
	print("pairwise coprime")
	os.exit()
end

local function gcd(x, y)
	if y == 0 then
		return x
	else
		return gcd(y, x % y)
	end
end

local is_setwise_coprime = false
local pre_gcd_num = a_t[1]
for i = 2, n do
	pre_gcd_num = gcd(max(pre_gcd_num, a_t[i]), min(pre_gcd_num, a_t[i]))
	if pre_gcd_num == 1 then
		is_setwise_coprime = true
		break
	end
end

print(is_setwise_coprime and "setwise coprime" or "not coprime")
