require 'prime'
s = gets.chomp.to_i

root_digit = (s**(1/2.0)).to_i.to_s.length

max = ("9"*root_digit).to_i


if s <= max
  a = s
  x = 0
  b = 0
  y = 1
else
  a = max
  y = s / a
  b = 1
  x = 1
  bx = s - a*y
  bx_prime_array = bx.prime_division.flatten.sort.reverse
  b_prime_array = bx_prime_array.each_slice(2).map(&:first)
  x_prime_array = bx_prime_array.each_slice(2).map(&:last)
  b = b_prime_array.inject(&:*) unless b_prime_array.empty?
  x = x_prime_array.inject(&:*) unless x_prime_array.empty?
end

# puts a
# puts y
# puts b
# puts x

points = [[0,0], [-x, a], [y, b]]
new_points = [[x, 0], [0, a], [y+x, b]]
# print points
# print new_points
puts new_points.flatten.join(' ')