input: def min_moves_to_capture_queen(a: int, b: int, c: int, d: int, e: int, f: int) -> int:
      """
      There is a 1-indexed 8 x 8 chessboard containing 3 pieces.
  
      You are given 6 integers a, b, c, d, e, and f where:
  
      (a, b) denotes the position of the white rook.
      (c, d) denotes the position of the white bishop.
      (e, f) denotes the position of the black queen.
  
      Given that you can only move the white pieces, return the minimum number of moves required to capture the black queen.
  
      Note that:
  
      Rooks can move any number of squares either vertically or horizontally, but cannot jump over other pieces.
      Bishops can move any number of squares diagonally, but cannot jump over other pieces.
      A rook or a bishop can capture the queen if it is located in a square that they can move to.
      The queen does not move.
  
      Examples:
      >>> a = 1, b = 1, c = 8, d = 8, e = 2, f = 3
      2
      >>> a = 5, b = 3, c = 3, d = 4, e = 5, f = 2
      1
  
      Constraints:
      1 <= a, b, c, d, e, f <= 8
      No two pieces are on the same square.
      """
  
output: 
      if a == e or b == f:
          return 1  # Rook can capture the queen in one move
      if abs(a - e) == abs(b - f):
          return 1  # Bishop can capture the queen in one move
      if (a == e or b == f) and (abs(a - e) == abs(b - f)):
          return 1  # Both pieces can capture the queen in one move
      return 2  # Otherwise, it takes at most 2 moves
  