Description

A pair of prime numbers that differ by 2 is called a twin prime pair. For example, 5 and 7, 17 and 19, etc. This problem requires finding all twin prime pairs where both numbers are less than or equal to n.

Input Format

A positive integern.1≤n≤10000.

Output Format

All twin prime pairs less than or equal ton. Each pair should be printed on a separate line, separated by a single space. If no twin prime pairs are found, output "empty".

```input1 10 ``` ```output1 3 5 5 7 ``` ```input2 100 ``` ```output2 3 5 5 7 11 13 17 19 29 31 41 43 59 61 71 73 ``` ```input3 3 ``` ```output3 empty ``` ## Source

CodesOnline