






def      _SCREAMING_SNAKE_CASE  (	__lowercase				:     int      )  -> int:





     """simple docstring"""

     barcode //= 1_0  # exclude the last digit
     __A             =		False
     __A             =		0

     # extract and check each digit
     while barcode != 0:
          __A             =		1 if checker else 3
          s += mult * (barcode % 1_0)
          barcode //= 1_0
          __A             =		not checker

     return (1_0 - (s % 1_0)) % 1_0



def      _SCREAMING_SNAKE_CASE  (	__lowercase				:     int      )  -> bool:





     """simple docstring"""

     return len(str(__lowercase      )      ) == 1_3 and get_check_digit(__lowercase      ) == barcode % 1_0



def      _SCREAMING_SNAKE_CASE  (	__lowercase				:     str      )  -> int:





     """simple docstring"""

     if str(__lowercase      ).isalpha():
          __A             =		f"Barcode '{barcode}' has alphabetic characters."
          raise ValueError(__lowercase      )
     elif int(__lowercase      ) < 0:
          raise ValueError("""The entered barcode has a negative value. Try again."""      )
     else:
          return int(__lowercase      )


if __name__ == "__main__":
  import doctest

  doctest.testmod()
  __a :    List[str]								=				get_barcode(input("Barcode: ").strip())

  if is_valid(barcode):
    print(f"""'{barcode}' is a valid barcode.""")
  else:
    print(f"""'{barcode}' is NOT a valid barcode.""")












def      _SCREAMING_SNAKE_CASE  (	__lowercase				:     list[int]      )  -> list[int]:





    """simple docstring"""

    if len(__lowercase      ) > 1:
        __A             =		len(__lowercase      ) // 2  # Finds the middle of the array
        __A             =		arr[
            :middle_length
        ]  # Creates an array of the elements in the first half.
        __A             =		arr[
            middle_length:
        ]  # Creates an array of the elements in the second half.
        __A             =		len(__lowercase      )
        __A             =		len(__lowercase      )
        merge(__lowercase      )  # Starts sorting the left.
        merge(__lowercase      )  # Starts sorting the right
        __A             =		0  # Left Counter
        __A             =		0  # Right Counter
        __A             =		0  # Position Counter
        while (
            left_index < left_size and right_index < right_size
        ):  # Runs until the lowers size of the left and right are sorted.
            if left_array[left_index] < right_array[right_index]:
                __A             =		left_array[left_index]
                left_index += 1
            else:
                __A             =		right_array[right_index]
                right_index += 1
            index += 1
        while (
            left_index < left_size
        ):  # Adds the left over elements in the left half of the array
            __A             =		left_array[left_index]
            left_index += 1
            index += 1
        while (
            right_index < right_size
        ):  # Adds the left over elements in the right half of the array
            __A             =		right_array[right_index]
            right_index += 1
            index += 1
    return arr


if __name__ == "__main__":
  import doctest

  doctest.testmod()




