n=int(input())
a=list(map(int,input().split()))
a_su=(sum(a))
import math
def is_prime(n:int):
    if n==1:
        return False
    for i in range(2,int(math.sqrt(n)+1)):
        if n%i==0:
            return False
    return True
if is_prime(a_su):
    for i in range(n-1):
        if math.gcd(a[i],a[i+1])!=1:
            print("setwise coprime")
    else:
        print("pairwise coprime")


else:
    print("not coprime")
