output_description: Print x_3,y_3,x_4 and y_4 as integers, in this order.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      x_1 y_1 x_2 y_2
attempt: z = list(map(int, input().split()))
  z.append(z[2] + z[1] - z[3])  # z[4](x_3)を生成
  z.append(z[3] - z[0] + z[2])  # z[5](y_3)を生成
  z.append(z[4] + z[3] - z[5])  # z[6](x_4)を生成
  z.append(z[5] - z[2] + z[4])  # z[7](y_4)を生成
  print(z[4], z[5], z[6], z[7])
  
problem_description: Statement
  
  There is a square in the xy-plane. The coordinates of its four vertices are
  (x_1,y_1),(x_2,y_2),(x_3,y_3) and (x_4,y_4) in counter-clockwise order.
  (Assume that the positive x-axis points right, and the positive y-axis points
  up.)
  
  Takahashi remembers (x_1,y_1) and (x_2,y_2), but he has forgot (x_3,y_3) and
  (x_4,y_4).
  
  Given x_1,x_2,y_1,y_2, restore x_3,y_3,x_4,y_4. It can be shown that
  x_3,y_3,x_4 and y_4 uniquely exist and have integer values.
samples: [{"input": "0 0 0 1", "output": "-1 1 -1 0\n    \n\n(0,0),(0,1),(-1,1),(-1,0) is the four vertices of a square in counter-\nclockwise order. Note that (x_3,y_3)=(1,1),(x_4,y_4)=(1,0) is not accepted, as\nthe vertices are in clockwise order.\n\n* * *"}, {"input": "2 3 6 6", "output": "3 10 -1 7\n    \n\n* * *"}, {"input": "31 -41 -59 26", "output": "-126 -64 -36 -131"}]