





from math import sqrt


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


def 							__snake_case							(    lowerCAmelCase_ = 1_0_0_0_1	)				->						int:
    SCREAMING_SNAKE_CASE__											=			0
    SCREAMING_SNAKE_CASE__											=			1
    while count != nth and number < 3:
        number += 1
        if is_prime(lowerCAmelCase_	):
            count += 1
    while count != nth:
        number += 2
        if is_prime(lowerCAmelCase_	):
            count += 1
    return number


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







import operator as op


def 							__snake_case							(    lowerCAmelCase_	)				->						str:
    SCREAMING_SNAKE_CASE__											=			[]
    SCREAMING_SNAKE_CASE__											=			lambda lowerCAmelCase_ ,							lowerCAmelCase_	: int(x / y	)  # noqa: E731 integer division operation
    SCREAMING_SNAKE_CASE__											=			{
        '''^''': op.pow,
        '''*''': op.mul,
        '''/''': div,
        '''+''': op.add,
        '''-''': op.sub,
    }  # operators & their respective operation

    # print table header
    print('''Symbol'''.center(8	) ,							'''Action'''.center(1_2	) ,							'''Stack''' ,							sep=''' | '''	)
    print('''-''' * (3_0 + len(lowerCAmelCase_	))	)

    for x in post_fix:
        if x.isdigit():  # if x in digit
            stack.append(lowerCAmelCase_	)  # append x to stack
            # output in tabular format
            print(x.rjust(8	) ,							('''push(''' + x + ''')''').ljust(1_2	) ,							''','''.join(lowerCAmelCase_	) ,							sep=''' | '''	)
        else:
            SCREAMING_SNAKE_CASE__											=			stack.pop()  # pop stack
            # output in tabular format
            print(''''''.rjust(8	) ,							('''pop(''' + b + ''')''').ljust(1_2	) ,							''','''.join(lowerCAmelCase_	) ,							sep=''' | '''	)

            SCREAMING_SNAKE_CASE__											=			stack.pop()  # pop stack
            # output in tabular format
            print(''''''.rjust(8	) ,							('''pop(''' + a + ''')''').ljust(1_2	) ,							''','''.join(lowerCAmelCase_	) ,							sep=''' | '''	)

            stack.append(
                str(opr[x](int(lowerCAmelCase_	) ,							int(lowerCAmelCase_	)	)	)	)  # evaluate the 2 values popped from stack & push result to stack
            # output in tabular format
            print(
                x.rjust(8	) ,							('''push(''' + a + x + b + ''')''').ljust(1_2	) ,							''','''.join(lowerCAmelCase_	) ,							sep=''' | ''' ,							)

    return int(stack[0]	)


if __name__ == "__main__":
  _A					:				Dict				=			input("""\n\nEnter a Postfix Equation (space separated) = """).split(""" """)
  print("""\n\tResult = """, solve(Postfix))
