
'''simple docstring'''


from itertools import permutations




def lowercase_	(   _lowercase				)     ->							bool:
					'''simple docstring'''

					if num[3] % 2 != 0:
										return False

					if (num[2] + num[3] + num[4]) % 3 != 0:
										return False

					if num[5] % 5 != 0:
										return False

					lowerCamelCase_					:      List[str]     =		[7, 11, 13, 17]
					for i, test in enumerate(_lowercase				):
										if (num[i + 4] * 100 + num[i + 5] * 10 + num[i + 6]) % test != 0:
															return False
					return True




def lowercase_	(   _lowercase = 10				)     ->							int:
					'''simple docstring'''

					return sum(
					    int(''''''.join(map(_lowercase			,       _lowercase				)				)				)
					    for num in permutations(range(_lowercase				)				)
					    if is_substring_divisible(_lowercase				)				)


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




'''simple docstring'''


from typing import TYPE_CHECKING

from ...utils import OptionalDependencyNotAvailable, _LazyModule, is_sentencepiece_available


__lowercase							:   int					=     {}

try:
					if not is_sentencepiece_available():
										raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
					pass
else:
					__lowercase							:   Any					=     ['''BartphoTokenizer''']

if TYPE_CHECKING:
					try:
										if not is_sentencepiece_available():
															raise OptionalDependencyNotAvailable()
					except OptionalDependencyNotAvailable:
										pass
					else:
										from .tokenization_bartpho import BartphoTokenizer

else:
					import sys

					__lowercase							:   Union[str, Any]					=     _LazyModule(__name__, globals()['''__file__'''], _import_structure, module_spec=__spec__)


