"""simple docstring"""







def       A__    (	lowercase_     :	int						)  ->							int:
   barcode //= 10  # exclude the last digit
   __lowerCamelCase    		=					False
   __lowerCamelCase    		=					0

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

   return (10 - (s % 10)) % 10



def       A__    (	lowercase_     :	int						)  ->							bool:
   return len(str(lowercase_						)						) == 13 and get_check_digit(lowercase_						) == barcode % 10



def       A__    (	lowercase_     :	str						)  ->							int:
   if str(lowercase_						).isalpha():
      __lowerCamelCase    		=					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()
     _SCREAMING_SNAKE_CASE	:		Dict   =   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.")











"""simple docstring"""


from itertools import permutations

def 					_lowerCAmelCase (  lowercase_ = 5		):
						if gon_side < 3 or gon_side > 5:
												raise ValueError('gon_side must be in the range [3, 5]'		)

						# Since it's 16, we know 10 is on the outer ring
						# Put the big numbers at the end so that they are never the first number
						UpperCAmelCase			 =					list(range(gon_side + 1						,      0						,      -1		)		)
						UpperCAmelCase			 =					list(range(gon_side + 2						,      gon_side * 2 + 1		)		)

						for perm in permutations(small_numbers + big_numbers		):
												UpperCAmelCase			 =					generate_gon_ring(lowercase_						,      list(lowercase_		)		)
												if is_magic_gon(lowercase_		):
																		return int(''.join(str(lowercase_		) for n in numbers		)		)

						UpperCAmelCase			 =					F"""Magic {gon_side}-gon ring is impossible"""
						raise ValueError(lowercase_		)

def 					_lowerCAmelCase (  lowercase_						,      lowercase_		):
						UpperCAmelCase			 =					[0] * (gon_side * 3)
						UpperCAmelCase			 =					perm[0:3]
						perm.append(perm[1]		)

						UpperCAmelCase			 =					1 if gon_side < 5 else 2

						for i in range(1						,      len(lowercase_		) // 3 + magic_number		):
												UpperCAmelCase			 =					perm[2 * i + 1]
												UpperCAmelCase			 =					result[3 * i - 1]
												UpperCAmelCase			 =					perm[2 * i + 2]

						return result

def 					_lowerCAmelCase (  lowercase_		):
						if len(lowercase_		) % 3 != 0:
												raise ValueError('a gon ring should have a length that is a multiple of 3'		)

						if min(numbers[::3]		) != numbers[0]:
												return False

						UpperCAmelCase			 =					sum(numbers[:3]		)

						return all(sum(numbers[i : i + 3]		) == total for i in range(3						,      len(lowercase_		)						,      3		)		)


if __name__ == "__main__":
				print(solution())





