require "prime"
#input of int(split by space)
def get_i()
  return gets.chomp.split(" ").map(&:to_i)
end
#input of float(split by space)
def get_f()
  return gets.chomp.split(" ").map(&:to_f)
end
#input of string(split by space)
def get()
  return gets.chomp.split(" ")
end
#input of string(split per one character)
def get_nsp()
  return gets.chomp.split("")
end
#yes or no decision
def yn_judge(bool,y="Yes",n="No")
  return bool ? y : n 
end
#create of array
def array(size1,init=nil,size2=-1)
  if size2==-1
      return Array.new(size1){init}
  else
      return Array.new(size2){Array.new(size1){init}}
  end
end

def max(a,b)
    return a>b ? a : b
end

def min(a,b)
    return a>b ? b : a
end

INF=Float::INFINITY

N=gets.to_i
A=get_i.sort{|x,y| y<=>x}

cnt=Hash.new(0)
flag=true
A.each do|a|
    p=Prime.prime_division(a)
    p.each do|k,v|
      if cnt[k]>0
        flag=false
      end 
      cnt[k]+=1
    end
end
if flag
    puts "pairwise coprime"
else
    cnt.each do|k,v|
        if v==N
            puts "not coprime"
            exit
        end
    end
    puts "setwise coprime"
end