Prime Pairs Sum

Given an integer \(N\), your task is to find all pairs of prime numbers \(p\) and \(q\) such that \(p \le q\) and \(p + q = N\). If there are no such pairs, output "No pairs found".

For example, when \(N=10\), the valid pairs are \((3, 7)\) and \((5, 5)\). Each pair should be printed on a separate line in the format "p q".

inputFormat

The input consists of a single integer \(N\) read from standard input.

outputFormat

If at least one pair of primes exists such that their sum equals \(N\), output each pair on a separate line in the format "p q". Otherwise, output "No pairs found".

10

3 7
5 5