Problem:
Score : 400 points

Problem Statement

Given is an integer S.
Find a combination of six integers X_1,Y_1,X_2,Y_2,X_3, and Y_3 that satisfies all of the following conditions:

0 \leq X_1,Y_1,X_2,Y_2,X_3,Y_3 \leq 10^9

The area of the triangle in a two-dimensional plane whose vertices are (X_1,Y_1),(X_2,Y_2), and (X_3,Y_3) is S/2.

We can prove that there always exist six integers that satisfy the conditions under the constraints of this problem.

Constraints

1 \leq S \leq 10^{18}

All values in input are integers.

Input

Input is given from Standard Input in the following format:

S

Output

Print six integers X_1,Y_1,X_2,Y_2,X_3, and Y_3 that satisfy the conditions, in this order, with spaces in between.
If multiple solutions exist, any of them will be accepted.

Sample Input 1

3

Sample Output 1

1 0 2 2 0 1

The area of the triangle in a two-dimensional plane whose vertices are (1,0),(2,2), and (0,1) is 3/2.
Printing 3 0 3 1 0 1 or 1 0 0 1 2 2 will also be accepted.

Sample Input 2

100

Sample Output 2

0 0 10 0 0 10

Sample Input 3

311114770564041497

Sample Output 3

314159265 358979323 846264338 327950288 419716939 937510582

Solution in Ruby (2.3.3) (judge verdict: Wrong Answer)

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)