Sum of Two Primes

Given an integer N, determine whether it can be expressed as the sum of two prime numbers. In other words, find two prime numbers \(p_{1}\) and \(p_{2}\) such that \(N = p_{1} + p_{2}\). If such a pair exists, output any valid pair; otherwise, output -1.

Note: For \(N < 4\), output -1 as there aren't enough primes to form a valid sum.

inputFormat

The input consists of a single integer N given via standard input.

outputFormat

If N can be written as a sum of two prime numbers, output the two primes separated by a space on a single line. If no such pair exists, output -1.## sample

4

2 2