input: 
  def IntList_find_min(int_list: IntList) -> int:
      """ Find the minimum value stored in the IntList data structure.
      >>> int_list = IntList()
      >>> int_list.add_value(3)
      >>> int_list.add_value(1)
      >>> int_list.add_value(4)
      >>> int_list.add_value(2)
      >>> IntList_find_min(int_list)
      1
      """
  
output:     if int_list.is_empty():
          raise ValueError("The list is empty")
      
      current = int_list.head
      min_value = current.value
      
      while current.next is not None:
          current = current.next
          if current.value < min_value:
              min_value = current.value
      
      return min_value