input: Write a python function to find the closest pair of points from a list of points.
  assert find_closest_pair_of_points([(0, 0), (1, 1), (2, 2), (3, 3)]) == [(0, 0), (1, 1)]
  assert find_closest_pair_of_points([(0, 0), (1, 1), (4, 4), (5, 5)]) == [(0, 0), (1, 1)]
  assert find_closest_pair_of_points([(-1, -1), (1, 1), (3, 3), (5, 5)]) == [(-1, -1), (1, 1)]
output: def find_closest_pair_of_points(points):
      import math
  
      def distance(p1, p2):
          return math.sqrt((p1[0] - p2[0]) ** 2 + (p1[1] - p2[1]) ** 2)
  
      min_distance = float('inf')
      closest_pair = []
  
      for i in range(len(points)):
          for j in range(i + 1, len(points)):
              dist = distance(points[i], points[j])
              if dist < min_distance:
                  min_distance = dist
                  closest_pair = [points[i], points[j]]
      
      return closest_pair