


from __future__ import annotations

import math
from itertools import permutations




def 				lowerCamelCase__				(						a__  :  str     )		->	bool:

       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(snake_case_     ) + 1     )	,      6     ):
              if number % i == 0 or number % (i + 2) == 0:
                     return False
       return True




def 				lowerCamelCase__				(						a__  :  List[Any] = 7     )		->	int:
       UpperCamelCase_							       =       ''''''.join(str(snake_case_     ) for i in range(1	,      n + 1     )     )
       UpperCamelCase_							       =       [int("""""".join(snake_case_     )     ) for i in permutations(snake_case_	,      snake_case_     )]
       UpperCamelCase_							       =       [num for num in perm_list if is_prime(snake_case_     )]
       return max(snake_case_     ) if pandigitals else 0


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





def 				lowerCamelCase__				(						a__  :  int     )		->	str:
       UpperCamelCase_							       =       1
       UpperCamelCase_							       =       0
       UpperCamelCase_							       =       1
       UpperCamelCase_							       =       1
       UpperCamelCase_							       =       3
       UpperCamelCase_							       =       3
       UpperCamelCase_							       =       limit
       UpperCamelCase_							       =       0

       UpperCamelCase_							       =       """"""
       while counter != decimal + 1:
              if 4 * q + r - t < n * t:
                     result += str(a__     )
                     if counter == 0:
                            result += "."

                     if decimal == counter:
                            break

                     counter += 1
                     UpperCamelCase_							       =       10 * (r - n * t)
                     UpperCamelCase_							       =       ((10 * (3 * q + r)) // t) - 10 * n
                     q *= 10
                     UpperCamelCase_							       =       nr
              else:
                     UpperCamelCase_							       =       (2 * q + r) * l
                     UpperCamelCase_							       =       (q * (7 * k) + 2 + (r * l)) // (t * l)
                     q *= k
                     t *= l
                     l += 2
                     k += 1
                     UpperCamelCase_							       =       nn
                     UpperCamelCase_							       =       nr
       return result




def 				lowerCamelCase__				(						)		->	None:
       print(f'''{calculate_pi(50     ) = }'''     )
       import doctest

       doctest.testmod()


if __name__ == "__main__":
      main()



