






"""simple docstring"""


def 			snake_case  (A_      :int = 1_0_0_0      ):







  '''simple docstring'''

  a     :			Union[str, Any]				=   0
  a     :			int				=   (n - 1) // 3
  total += ((terms) * (6 + (terms - 1) * 3)) // 2  # total of an A.P.
  a     :			Tuple				=   (n - 1) // 5
  total += ((terms) * (1_0 + (terms - 1) * 5)) // 2
  a     :			Dict				=   (n - 1) // 1_5
  total -= ((terms) * (3_0 + (terms - 1) * 1_5)) // 2
  return total


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










'''simple docstring'''



from __future__ import annotations

import math
from itertools import permutations







def 	_UpperCamelCase       (_lowerCamelCase							:   int		)->      bool:




     '''simple docstring'''





     if 1 < number < 4:
          # 2 and 3 are primes
          return True
     elif number < 2 or number % 2 == 0 or number % 3 == 0:
          # Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
          return False

     # All primes number are in format of 6k +/- 1
     for i in range(5      ,		int(math.sqrt(_lowerCamelCase		) + 1		)      ,		6		):
          if number % i == 0 or number % (i + 2) == 0:
               return False
     return True







def 	_UpperCamelCase       (_lowerCamelCase							:   int = 7		)->      int:




     '''simple docstring'''





     __snake_case			    =     ''''''.join(str(_lowerCamelCase		) for i in range(1      ,		n + 1		)		)
     __snake_case			    =     [int(''''''.join(_lowerCamelCase		)		) for i in permutations(_lowerCamelCase      ,		_lowerCamelCase		)]
     __snake_case			    =     [num for num in perm_list if is_prime(_lowerCamelCase		)]
     return max(_lowerCamelCase		) if pandigitals else 0


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






