use std::collections::HashSet;
const MAX_N: usize = 1000_010;
pub mod gcd {
    pub trait Gcd {
        type Output;
        fn gcd(self, other: Self) -> Self::Output;
    }
    #[warn(unused_macros)]
    macro_rules! gcd_unsigned_impl {
        ($($t:ty)*) => ($(
            impl Gcd for $t {
                type Output = $t;
                fn gcd(self, other: Self) -> Self::Output {
                    if self == 0 {
                        other
                    } else if other == 0 {
                        self
                    } else {
                        if self < other {
                            self.gcd(other % self)
                        } else {
                            other.gcd(self % other)
                        }
                    }
                }
            }
        )*)
    }
    #[warn(unused_macros)]
    macro_rules! gcd_signed_impl {
        ($($t:ty)*) => ($(
            impl Gcd for $t {
                type Output = $t;
                fn gcd(self, other: Self) -> Self::Output {
                    if self == 0 {
                        other.abs()
                    } else if other == 0 {
                        self.abs()
                    } else {
                        if self.abs() < other.abs() {
                            self.gcd(other % self)
                        } else {
                            other.gcd(self % other)
                        }
                    }
                }
            }
        )*)
    }
    gcd_signed_impl!(i32 i64);
    gcd_unsigned_impl!(usize u32 u64);
}

#[cfg(test)]
mod tests {
    use super::gcd::Gcd;
    #[test]
    fn test_gcd() {
        assert_eq!(8.gcd(10), 2);
        assert_eq!(10.gcd(8), 2);
        assert_eq!(11.gcd(9), 1);
        assert_eq!(9.gcd(11), 1);
        assert_eq!(10.gcd(100), 10);
        assert_eq!((-10i32).gcd(-100i32), 10);
        assert_eq!((-25i32).gcd(-30i32), 5);
        assert_eq!((-30i32).gcd(-25i32), 5);
    }
}
use gcd::Gcd;
#[derive(Default)]
//NOTE
//declare variables to reduce the number of parameters for dp and dfs etc.
struct Solver {}

impl Solver {
    fn solve(&mut self) {
        let stdin = std::io::stdin();
        let mut scn = Scanner {
            stdin: stdin.lock(),
        };
        let n: usize = scn.read();
        let mut a: Vec<usize> = scn.vec(n);
        a.sort();
        let mut is_prime = vec![true; MAX_N];
        let mut primes = vec![];
        is_prime[0] = false;
        is_prime[1] = false;
        for i in 2..MAX_N {
            if is_prime[i] {
               let mut j = 2;
                while i * j < MAX_N {
                    is_prime[i * j] = false;
                    j += 1;
                }
                primes.push(i);
            }
        }
        let mut results = HashSet::new();
        let mut pair = true;
        for &x in a.iter() {
            let mut tmp = x;
            let mut j = 0;
            while tmp > 1 && j < primes.len() {
                let mut ok = false;
                if tmp < primes[j] {
                    break;
                }
                while tmp % primes[j] == 0 {
                    tmp /= primes[j];
                    ok = true;
                }
                if ok {
                    if results.contains(&primes[j]) {
                        pair = false;
                        break;
                    }
                    results.insert(primes[j]);
                }
                j += 1;
            }
            if tmp > 1 {
                if results.contains(&tmp) {
                    pair = false;
                    break;
                }
                results.insert(tmp);
            }
        }

        if pair {
            println!("pairwise coprime");
            return ;
        }
        let mut gcd = a[0];
        for &x in a.iter().skip(1) {
            gcd = gcd.gcd(x);
        }
        if gcd == 1 {
            println!("setwise coprime");
            return ;
        }
        println!("not coprime");

    }
}

fn main() {
    std::thread::Builder::new()
        .stack_size(64 * 1024 * 1024) // 64MB
        .spawn(|| {
            let mut solver = Solver::default();
            solver.solve()
        })
        .unwrap()
        .join()
        .unwrap();
}
pub mod utils {
    const DYX: [(isize, isize); 8] = [
        (0, 1),   //right
        (1, 0),   //down
        (0, -1),  //left
        (-1, 0),  //top
        (1, 1),   //down right
        (-1, 1),  //top right
        (1, -1),  //down left
        (-1, -1), //top left
    ];

    pub fn try_adj(y: usize, x: usize, dir: usize, h: usize, w: usize) -> Option<(usize, usize)> {
        let ny = y as isize + DYX[dir].0;
        let nx = x as isize + DYX[dir].1;
        if ny >= 0 && nx >= 0 {
            let ny = ny as usize;
            let nx = nx as usize;
            if ny < h && nx < w {
                Some((ny, nx))
            } else {
                None
            }
        } else {
            None
        }
    }
}

//snippet from kenkoooo
pub struct Scanner<R> {
    stdin: R,
}

impl<R: std::io::Read> Scanner<R> {
    pub fn read<T: std::str::FromStr>(&mut self) -> T {
        use std::io::Read;
        let buf = self
            .stdin
            .by_ref()
            .bytes()
            .map(|b| b.unwrap())
            .skip_while(|&b| b == b' ' || b == b'\n' || b == b'\r')
            .take_while(|&b| b != b' ' && b != b'\n' && b != b'\r')
            .collect::<Vec<_>>();
        unsafe { std::str::from_utf8_unchecked(&buf) }
            .parse()
            .ok()
            .expect("Parse error.")
    }
    pub fn read_line(&mut self) -> String {
        use std::io::Read;
        let buf = self
            .stdin
            .by_ref()
            .bytes()
            .map(|b| b.unwrap())
            .skip_while(|&b| b == b'\n' || b == b'\r')
            .take_while(|&b| b != b'\n' && b != b'\r')
            .collect::<Vec<_>>();
        unsafe { std::str::from_utf8_unchecked(&buf) }
            .parse()
            .ok()
            .expect("Parse error.")
    }
    pub fn vec<T: std::str::FromStr>(&mut self, n: usize) -> Vec<T> {
        (0..n).map(|_| self.read()).collect()
    }

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