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: Time Limit Exceeded)

s=gets.to_i
n=[s,10**9].min

(0..n).each do |x1|
  (0..n).each do |y1|
    x2max=n
    if y1!=0
      x2max=(s*(s+1)*1.0/y1).ceil
    end
    (0..x2max).each do |x2|
      y2max=n
      if x1!=0
        y2max=((x2*y1+4)*1.0/x1).ceil
      end
      prev_s = -1
      (0..y2max).each do |y2|
        curr_s = (x2*y1-x1*y2).abs
        if s==curr_s
          puts "0 0 #{x1} #{y1} #{x2} #{y2}"
          exit
          break
        elsif prev_s == -1
        elsif s < curr_s
          break if curr_s > prev_s
        elsif s > curr_s
          break if curr_s < prev_s
        end
        prev_s = (x2*y1-x1*y2).abs
      end
    end
  end
end