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
  bx = s - a*y
  if bx == 0
    b = 0
    x = 0
  else
    b = 1
    x = 1

    bx_primes = []
    bx.prime_division.each do |k|
      k[1].times do
        bx_primes << k[0]
      end
    end

    # b_prime_array = []
    # x_prime_array = []
    bx_primes.reverse.each do |r|
      if b <= x
        b = b*r
      else
        x = x*r
      end
    end
  end
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(' ')


# print new_points.flatten

# print ((a+b)*(y+x)/2.0) - (x*a/2.0) - (y*b/2.0)