#![allow(non_snake_case)]
#![allow(dead_code)]
#![allow(unused_macros)]
#![allow(unused_imports)]

use std::str::FromStr;
use std::io::*;
use std::collections::*;
use std::cmp::*;
use std::ops::*;

struct Scanner<I: Iterator<Item = char>> {
    iter: std::iter::Peekable<I>,
}

macro_rules! exit {
    () => {{
        exit!(0)
    }};
    ($code:expr) => {{
        if cfg!(local) {
            writeln!(std::io::stderr(), "===== Terminated =====")
                .expect("failed printing to stderr");
        }
        std::process::exit($code);
    }}
}

impl<I: Iterator<Item = char>> Scanner<I> {
    pub fn new(iter: I) -> Scanner<I> {
        Scanner {
            iter: iter.peekable(),
        }
    }

    pub fn safe_get_token(&mut self) -> Option<String> {
        let token = self.iter
            .by_ref()
            .skip_while(|c| c.is_whitespace())
            .take_while(|c| !c.is_whitespace())
            .collect::<String>();
        if token.is_empty() {
            None
        } else {
            Some(token)
        }
    }

    pub fn token(&mut self) -> String {
        self.safe_get_token().unwrap_or_else(|| exit!())
    }

    pub fn get<T: FromStr>(&mut self) -> T {
        self.token().parse::<T>().unwrap_or_else(|_| exit!())
    }

    pub fn vec<T: FromStr>(&mut self, len: usize) -> Vec<T> {
        (0..len).map(|_| self.get()).collect()
    }

    pub fn mat<T: FromStr>(&mut self, row: usize, col: usize) -> Vec<Vec<T>> {
        (0..row).map(|_| self.vec(col)).collect()
    }

    pub fn char(&mut self) -> char {
        self.iter.next().unwrap_or_else(|| exit!())
    }

    pub fn chars(&mut self) -> Vec<char> {
        self.get::<String>().chars().collect()
    }

    pub fn mat_chars(&mut self, row: usize) -> Vec<Vec<char>> {
        (0..row).map(|_| self.chars()).collect()
    }

    pub fn line(&mut self) -> String {
        if self.peek().is_some() {
            self.iter
                .by_ref()
                .take_while(|&c| !(c == '\n' || c == '\r'))
                .collect::<String>()
        } else {
            exit!();
        }
    }

    pub fn peek(&mut self) -> Option<&char> {
        self.iter.peek()
    }
}

fn gcd<T>(v1: T, v2: T) -> T
where
    T: Rem<Output=T>
     + Copy
     + Default
     + PartialEq    
{
    let zero = T::default();
    match (v1, v2) {
        (v1, v2) if v2 == zero => v1,
        (v1, v2) => gcd(v2, v1 % v2)
    }
}

const MAX: usize = 100;

fn main() {
    let cin = stdin();
    let cin = cin.lock();
    let mut sc = Scanner::new(cin.bytes().map(|c| c.unwrap() as char));
    let N: usize = sc.get();
    let mut A = Vec::new();
    let mut s = HashSet::new();
    let mut pair = true;
    for _ in 0..N {
        let ai: usize = sc.get();
        A.push(ai);
        s.insert(ai);
    }
    let mut sieves = vec![true; MAX+1];
    sieves[1] = false;
    for i in (2..).take_while(|i| i * i <= MAX) {
        if !sieves[i] {
            continue;
        }
        for j in (i*2..=MAX).step_by(i) {
            sieves[j] = false;
        }
    }
    let mut primes = Vec::new();
    for i in 2..=MAX {
        if sieves[i] {
            primes.push(i);
        }
    }
    'outer: for &p in &primes {
        let mut cnt = 0;
        for i in 0..N {
            if A[i] % p == 0 {
                cnt += 1;
            }
        }
        if cnt >= 2 {
            pair = false;
            break 'outer;
        }
    }
    if pair {
        println!("pairwise coprime");
        return;
    }
    let mut g = 0;
    for i in 0..N {
        g = gcd(g, A[i]);
    }
    if g == 1 {
        println!("setwise coprime");
    } else {
        println!("not coprime");
    }
}
