import functools
from typing import Any


def 	lowerCamelCase					(	UpperCamelCase     :				str			,       UpperCamelCase     :				list[str]							)   ->    bool:

		# Validation
		if not isinstance(UpperCamelCase			,       UpperCamelCase							) or len(UpperCamelCase							) == 0:
				raise ValueError('the string should be not empty string'							)

		if not isinstance(UpperCamelCase			,       UpperCamelCase							) or not all(
		    isinstance(UpperCamelCase			,       UpperCamelCase							) and len(UpperCamelCase							) > 0 for item in words							):
				raise ValueError('the words should be a list of non-empty strings'							)

		# Build trie
		_lowerCamelCase				   =  {}
		_lowerCamelCase				   =  'WORD_KEEPER'

		for word in words:
				_lowerCamelCase				   =  trie
				for c in word:
						if c not in trie_node:
								_lowerCamelCase				   =  {}

						_lowerCamelCase				   =  trie_node[c]

				_lowerCamelCase				   =  True

		_lowerCamelCase				   =  len(UpperCamelCase							)

		# Dynamic programming method
		@functools.cache
		def is_breakable(UpperCamelCase     :				int							) -> bool:
				if index == len_string:
						return True

				_lowerCamelCase				   =  trie
				for i in range(UpperCamelCase			,       UpperCamelCase							):
						_lowerCamelCase				   =  trie_node.get(string[i]			,       UpperCamelCase							)

						if trie_node is None:
								return False

						if trie_node.get(UpperCamelCase			,       UpperCamelCase							) and is_breakable(i + 1							):
								return True

				return False

		return is_breakable(0							)


if __name__ == "__main__":
				import doctest

				doctest.testmod()
def 	lowerCamelCase					(	UpperCamelCase     :				int = 60_08_51_47_51_43							)   ->    int:

		try:
				_lowerCamelCase				   =  int(UpperCamelCase							)
		except (TypeError, ValueError):
				raise TypeError('Parameter n must be int or castable to int.'							)
		if n <= 0:
				raise ValueError('Parameter n must be greater than or equal to one.'							)
		_lowerCamelCase				   =  1
		_lowerCamelCase				   =  2
		while i * i <= n:
				while n % i == 0:
						_lowerCamelCase				   =  i
						n //= i
				i += 1
		if n > 1:
				_lowerCamelCase				   =  n
		return int(UpperCamelCase							)


if __name__ == "__main__":
				print(F'''{solution() = }''')