Verifying Goldbach's Conjecture (Weak Form)

Given an odd integer \(n\) (with \(n \ge 7\)), output 3 prime numbers such that their sum is equal to \(n\). According to Goldbach's weak conjecture, every odd number greater than 5 can be expressed as the sum of three primes. If multiple answers exist, any valid one is acceptable.

inputFormat

The input consists of a single line containing an odd integer \(n\) (\(n \ge 7\)).

outputFormat

Output 3 prime numbers separated by spaces such that their sum equals \(n\).

sample

7

2 2 3