/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author
 */

#include <iostream>
#include <fstream>

#include <iostream>
#include "bits/stdc++.h"

using namespace std;
typedef unsigned long long ll;
typedef int                     integer;
//#define int                     long long
#define ii                      pair<int,int>
#define vii                     vector<pair<int,int>>
#define vi                      vector<int>
#define vvi                     vector<vector<int>>
#define f(a,b,c)                for(int a=b;a<c;a++)
#define s(x)                    in>>x
#define s2(x,y)                 in>>x>>y
#define s3(x,y,z)               in>>x>>y>>z
#define s4(x,y,z,w)             in>>x>>y>>z>>w
#define p(x)                    out<<x<<endl
#define p2(x,y)                 out<<x<<' '<<y<<endl
#define p3(x,y,z)               out<<x<<' '<<y<<' '<<z<<endl
#define p4(x,y,z,w)             out<<x<<' '<<y<<' '<<z<<' '<<w<<endl
#define pl(x)                   out<<x
#define pll(x)                  out<<x<<' '
#define range(v)                v.begin(),v.end()
#define rst(x)                  memset(x, -1, sizeof(x))
#define UNVISITED               -1
#define VISITED                 0
#define EXPLORED                2

#define EACH(x, a) for (auto& x: a)
template<class T> void read_v(T& x, std::istream& in) {
    in >> (x);
}
template<class A> void read_vec(vector<A>& x, std::istream& in) {
    EACH(a, x)
        read_v(a, in);
}

bool sortpairbysec(const pair<int,int> &a,const pair<int,int> &b){return (a.second < b.second);}
template <typename T>
T factmod(T a, T modulus){ int res = 1, i; for (i = 2; i <= a; i++){ res *= i; res%=modulus;} return res; }
template <typename T>
int powmod(T a,T b,int m){ int ans=1; while(b>0){if(b&1){ans*=a;ans%=m;}a*=a;a%=m;b>>=1;} return ans; }
template <typename T>
int power(T a, T b){ int ans=1; while(b>0){if(b&1){ans*=a;}a*=a;b>>=1;}return ans;}

int smallest_divisor(int n){
    if(n%2==0){return 2;}
    for(int i = 3; i * i <= n; i += 2){
        if(n % i == 0){
            return i;
        }
    }
    return n;
}

void ssolve(std::istream& in, std::ostream& out){
    int n; s(n);
    vi a(n);

    vi divs_cnt(1e6 + 1, 0);
    vi new_divs_cnt(1e6 + 1, 0);
    bool pw = true;
    f(i, 0, n){
        s(a[i]);
        int entry = a[i];
        int aux;
        while(entry!=1){
            aux = smallest_divisor(entry);
            new_divs_cnt[aux]++;
            if(new_divs_cnt[aux]>1&&divs_cnt[aux]!=0){pw=false;}
            entry /= aux;
        }
        divs_cnt = new_divs_cnt;
    }

    if(pw) {
        p("pairwise coprime");
        return;
    }
    int aux = gcd(a[0], a[1]);
    f(i, 0, n){
        if (i > 0) aux = gcd(a[i], aux);
    }
    if(aux==1){
        p("setwise coprime");
        return;
    }else{
        p("not coprime");
    }
}

class ECoprime {
public:
void solve(std::istream& in, std::ostream& out) {
    ios_base::sync_with_stdio(false);
    in.tie(nullptr);out.tie(nullptr);
    int t;
    int READ = 0;
    if(READ) s(t);
    else t = 1;
    while(t--){
        ssolve(in, out);
    }
}
};

integer main() {
    ECoprime solver;
    std::istream& in(std::cin);
     std::ostream& out(std::cout);
     solver.solve(in, out);
}