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 Fortran (gfortran v4.8.4) (judge verdict: Time Limit Exceeded)

program triangle
  implicit none
  integer(8) :: s, h, w, a, b, d
  integer(8) :: x1, y1, x2, y2, x3, y3, i
  read(*,*) s
  x1 = 0_8
  y1 = 0_8
  h = int(ceiling(sqrt(real(s,8))),8)
  w = h
  d = h*w-s
  a = 0_8
  b = 0_8
  if (d > 0_8) then
    a = int(floor(sqrt(real(d,8))),8)
    do while (a < d)
      if (mod(d,a) == 0_8) exit
      a = a+1_8
    end do
    b = d/a
  end if
  x2 = a
  y2 = h
  x3 = w
  y3 = b
  write(*,'(i0,x,i0,x,i0,x,i0,x,i0,x,i0)') x1, y1, x2, y2, x3, y3
  stop
end program triangle