





"""simple docstring"""


from itertools import permutations

def      UpperCamelCase							(SCREAMING_SNAKE_CASE     ):
						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

						UpperCamelCase				:		Optional[int]				   =			[7, 11, 13, 17]
						for i, test in enumerate(SCREAMING_SNAKE_CASE     ):
												if (num[i + 4] * 100 + num[i + 5] * 10 + num[i + 6]) % test != 0:
																		return False
						return True

def      UpperCamelCase							(SCREAMING_SNAKE_CASE = 10     ):
						return sum(
						    int("""""".join(map(SCREAMING_SNAKE_CASE							,     SCREAMING_SNAKE_CASE     )     )     )
						    for num in permutations(range(SCREAMING_SNAKE_CASE     )     )
						    if is_substring_divisible(SCREAMING_SNAKE_CASE     )     )


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







from math import factorial



def       _lowerCAmelCase    (				lowerCAmelCase_				:int = 20				)->int:
   '''simple docstring'''






   snake_case_            =       2 * n  # middle entry of odd rows starting at row 3 is the solution for n = 1,
   # 2, 3,...
   snake_case_            =       n // 2

   return int(factorial(lowerCAmelCase_				) / (factorial(lowerCAmelCase_				) * factorial(n - k				))				)


if __name__ == "__main__":
   import sys

   if len(sys.argv) == 1:
      print(solution(20))
   else:
      try:
         SCREAMING_SNAKE_CASE						:Any			=  int(sys.argv[1])
         print(solution(n))
      except ValueError:
         print('''Invalid entry - please enter a number.''')




