Scanf.scanf "%d" (fun n ->
    let div = Array.make 1000000 0 in
    let rec gcd a b = if b = 0 then a else gcd b (a mod b) in
    let rec loop i g =
        if i = n then g else
            let g = Scanf.scanf " %d" (fun a ->
                let g = gcd a g in
                let rec loop r i =
                    if r = 1 then () else
                    if i * i > r then div.(r) <- div.(r) + 1 else
                        if r mod i <> 0 then loop r (i + 1) else
                            let () = div.(i) <- div.(i) + 1 in
                            let rec loop2 r =
                                if r mod i = 0 then loop2 (r / i) 
                                    else loop r (i + 1)
                            in
                            loop2 r
                in
                loop a 2;
                g
            )
            in
            loop (i + 1) g
    in
    let g = loop 0 0 in
    print_endline @@
        if g <> 1 then "not coprime" else
            if Array.fold_left max 0 div = 1 then "pairwise coprime" else "setwise coprime"
)