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: import sys
  
  # 関数 solve は，もちろん，問題に応じて書き換える
  def solve(a,b,c,d):
      x = c-a
      y = d-b
      x3 = 0
      x4 = 0
      y3 = 0
      y4 = 0
      #print(x,y)
      x3 = c-y
      y3 = d+x
      x4 = x3-x
      y4 = y3-y
      return x3,x4,y3,y4
  
  # ここから下は，入力・出力形式が同じであれば，変えなくて良い．
  def readQuestion():
      line = sys.stdin.readline().rstrip()
      [str_a, str_b, str_c, str_d] = line.split(' ')
      return (int(str_a), int(str_b), int(str_c)), int(str_d))
  
  def main():
      a, b, c, d = readQuestion()
      answer = solve(a, b, c, d)
      print(answer)
      
  if __name__ == '__main__':
      main()
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"}]