$edge = sqrt 2 * 10 ** 9;

@_ = (1) x $edge;

for $i (2..$edge){
	$j = $i ** 2 + $i; 	# not excludes (prime ^ 2)s
	while ($j < $edge){
		$_[$j] = 0;
		$j += $i;
		}
	}
	
@primes = ();
$_[$_-1] and push @primes, $_-1 for 1..@_;  
shift @primes; shift @primes;
# made array of ~primes (2, 3, [4], 5, 7, [9], 11, 13, 17..)

@ans = ();
for (1..<>){
	$_ = <>, chomp;
	$false = 1;
	for $i (@primes){
		$g = $i;  # copy of $i (~prime)
		$i > $_ and last; 
		($_ + ($i % 2 ? 0 : $i / 2 )) % $i or ($false-- and last);
		}
	if ($_ / $g - $g / 2 + 1 < 1){ $false = 1}
	push @ans,( $false ? IMPOSSIBLE : ($_, " = ", join ' + ', ($_ / $g - $g / 2 + 1 .. $_ / $g + $g / 2)));
	push @ans, "\n";
	}
print @ans