#include <bits/stdc++.h>
using namespace std;

int main(){
    int A = 1000005;
    int n;
    cin>>n;
    vector<int> a(n);
    vector<int> c(A, 0);
    int max = 0;
    
    for(int i=0;i<n;i++){
        cin>>a[i];
        c[a[i]] += 1;
    }


    //素数に対しO(1)の計算量
    bool pairwise = true;
    for(int i=2;i<A;i++){
        int count = 0;
        for(int j=1;j*i<A;j++){
            count += c[j*i];
        }
        if(count>1) pairwise = false;
        if(count==n){
            cout<<"not coprime"<<endl;
            return 0;
        }
    }

    if(pairwise){
        cout<<"pairwise coprime"<<endl;
        return 0;
    }

    cout<<"setwise coprime"<<endl;
    
    return 0;

}