Absolute Primes

Problem Background

Special for beginners, ^_^

Problem Description

A natural number is called an absolute prime if it is prime and remains prime after swapping the positions of its two digits. For example, $13$ is an absolute prime. Find all two-digit absolute primes.

Input Format

This problem has no input.

Output Format

Output all two-digit absolute primes, in increasing order, one number per line.

Sample Input

(none — this problem has no input)

Sample Output

(none provided; print all two-digit absolute primes, one per line)

Constraints

Time limit: 1s, memory limit: 1024KiB for each test case.