output_description: 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.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      S
attempt: s = int(input())
  
  ans_list = [0 for _ in range(6)]
  num = s
  count = 0
  
  while num > 1000000000:
      num //= 2
      count += 1
  ans_list[0] = num
  ans_list[3] = 2**count
  
  while s >= ans_list[0] * ans_list[3] and ans_list[3] < 1000000000:
      ans_list[3] += 1
  
  if ans_list[3] > 1000000000:
      ans_list[3] = 1000000000
      ans_list[0] = s // 1000000000 + 1
  if ans_list[0] > 1000000000:
      ans_list[0] = 1000000000
  
  ans_list[1] = 1
  
  sum_ = ans_list[0] * ans_list[3]
  ans_list[2] = sum_ - s
  
  print(
      "{} {} {} {} {} {}".format(
          ans_list[0], ans_list[1], ans_list[2], ans_list[3], ans_list[4], ans_list[5]
      )
  )
  
problem_description: 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.
samples: [{"input": "3", "output": "1 0 2 2 0 1\n    \n\nThe area of the triangle in a two-dimensional plane whose vertices are\n(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\nalso be accepted.\n\n* * *"}, {"input": "100", "output": "0 0 10 0 0 10\n    \n\n* * *"}, {"input": "311114770564041497", "output": "314159265 358979323 846264338 327950288 419716939 937510582"}]