package main

import (
	"fmt"
	"math/bits"
)

func main() {
	var n int
	fmt.Scanf("%d", &n)
	for i := 0; i < n; i++ {
		var x uint64
		fmt.Scanf("%d", &x)
		if isPrime(x) {
			fmt.Printf("%d 1\n", x)
		} else {
			fmt.Printf("%d 0\n", x)
		}
	}
}

func modMul(a, b, m uint64) uint64 {
	h, l := bits.Mul64(a, b)
	_, rem := bits.Div64(h, l, m)
	return rem
}

func modPow(x, y, m uint64) uint64 {
	res := uint64(1)
	for y > 0 {
		if y&1 != 0 {
			res = modMul(res, x, m)
		}
		x = modMul(x, x, m)
		y >>= 1
	}
	return res
}

func isPrime(x uint64) bool {
	if x <= 1 {
		return false
	}
	if x == 2 {
		return true
	}
	if x%2 == 0 {
		return false
	}

	s := bits.TrailingZeros64(x - 1)
	d := (x - 1) >> s

	for _, a := range []uint64{2, 325, 9375, 28178, 450775, 9780504, 1795265022} {
		if a%x == 0 {
			continue
		}
		t := modPow(a, d, x)
		if t == 1 || t == x-1 {
			continue
		}
		for i := 1; t != x-1; i++ {
			if i >= s {
				return false
			}
			t = modMul(t, t, x)
		}
	}
	return true
}