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)

def array_rotate(array, val)
  array.shift
  array.push(val)

  array
end

s = gets.chomp.to_f

max = 1_000_000_000
aa = b = nil

1.upto(s).each do |a|
  b = max
  b_min = 1
  b_max = max
  prev_b_list = Array.new(10)

  while prev_b_list.count(b.to_i) <= 2
    tmp = a * b.to_i
    if tmp == s
      aa = a
      break
    end

    array_rotate(prev_b_list, b.to_i)

    next_calc = tmp < s ? :+ : :-

    d = case next_calc
        when :+
          b_min = b
          b + (b_max - b).to_f.div(2)
        when :-
          b_max = b
          b - (b - b_min).to_f.div(2)
        end.abs

    # puts "#{a}, #{b}"
    p prev_b_list
    b = b.send(next_calc, d)
    # binding.irb if prev_b_list.include?(b.to_i)
  end
end

puts "0 0 #{aa} 0 0 #{b}"