// -*- coding:utf-8-unix -*-
pub fn modmul(a: u64, b: u64, n: u64) -> u64 {
    debug_assert!(a < n);
    debug_assert!(b < n);
    // inline assembly: Rust 1.59 or later (stable)
    if cfg!(target_arch = "x86_64") {
        use std::arch::asm;
        let mut x: u64;
        unsafe{asm!(
            "mul {0}",
            "div {1}",
            in(reg) b,
            in(reg) n,
            inout("rax") a => _,
            out("rdx") x,
            options(pure, nomem, nostack),
        )}
        debug_assert_eq!(((a as u128) * (b as u128) % (n as u128)) as u64, x);
        x
    } else {
        ((a as u128) * (b as u128) % (n as u128)) as u64
    }
}
pub fn modpow(mut b: u64, mut p: u64, n: u64) -> u64 {
    let mut r = if (p & 1) == 0 { 1 } else { b };
    loop {
        p >>= 1; if p == 0 { return r; }
        b = modmul(b, b, n); if p & 1 != 0 { r = modmul(r, b, n); }
    }
}
pub fn miller_rabin(n: u64) -> bool {
    if n == 2 { return true; }
    if n < 2 || n & 1 == 0 { return false; }
    let n1 = n - 1;
    let s = n1.trailing_zeros();
    let d = n1 >> s;
    [2,325,9375,28178,450775,9780504,1795265022].iter().all(|&base| {
        let a = if base < n { base } else { base % n };
        if a == 0 { return true; }
        let mut t = modpow(a, d, n);
        if t == 1 || t == n1 { return true; }
        for _ in 1..s { t = modmul(t, t, n); if t == n1 { return true; } }
        false
    })
}
pub fn main() {
    use std::io::{stdin, stdout, BufReader, BufRead, BufWriter, Write};
    let start_time = std::time::Instant::now();
    let out = stdout();
    let mut writer = BufWriter::new(out.lock());
    let inp = stdin();
    let mut reader = BufReader::new(inp.lock());
    let mut ibuf = Vec::<u8>::new();
    let len = reader.read_until(b'\n', &mut ibuf).unwrap();
    let tr = &ibuf[0..=((0..len).rfind(|&i| ibuf[i] > 0x20).unwrap())];
    let n = tr.iter().fold(0, |a, &c| a * 10 + (c & 0x0f) as usize);
    for _ in 0..n {
        ibuf.clear();
        let len = reader.read_until(b'\n', &mut ibuf).unwrap();
        let len = (0..len).rfind(|&i| ibuf[i] > 0x20).unwrap();
        let tr = &ibuf[0..=len];
        let x = tr.iter().fold(0, |a, &c| a * 10 + (c & 0x0f) as u64);
        let res = miller_rabin(x);
        writer.write(tr).unwrap();
        writer.write(if res { b" 1\n" } else { b" 0\n" }).unwrap();
    }
    writer.flush().unwrap();
    eprint!("{}us\n", start_time.elapsed().as_micros());
}