






from __future__ import annotations

from typing import Any

def      _lowerCamelCase	(						__A    :							list )      ->					int:
    if not postfix_notation:
        return 0

    _UpperCAmelCase				:      List[str]			  =				{'''+''', '''-''', '''*''', '''/'''}
    _UpperCAmelCase				:      list[Any]			  =				[]

    for token in postfix_notation:
        if token in operations:
            _UpperCAmelCase  , _UpperCAmelCase				:      Tuple			  =				stack.pop(), stack.pop()
            if token == "+":
                stack.append(a + b )
            elif token == "-":
                stack.append(a - b )
            elif token == "*":
                stack.append(a * b )
            else:
                if a * b < 0 and a % b != 0:
                    stack.append(a // b + 1 )
                else:
                    stack.append(a // b )
        else:
            stack.append(int(__A ) )

    return stack.pop()


if __name__ == "__main__":
  import doctest

  doctest.testmod()












from __future__ import annotations

def      _lowerCamelCase	(						__A    :							int )      ->					list[int]:
    _UpperCAmelCase				:      List[str]			  =				[True] * limit
    _UpperCAmelCase				:      Optional[int]			  =				False
    _UpperCAmelCase				:      Dict			  =				False
    _UpperCAmelCase				:      List[str]			  =				True

    for i in range(3		,		int(limit**0.5 + 1 )		,		2 ):
        _UpperCAmelCase				:      List[str]			  =				i * 2
        while index < limit:
            _UpperCAmelCase				:      Union[str, Any]			  =				False
            _UpperCAmelCase				:      int			  =				index + i

    _UpperCAmelCase				:      Optional[int]			  =				[2]

    for i in range(3		,		__A		,		2 ):
        if is_prime[i]:
            primes.append(__A )

    return primes

def      _lowerCamelCase	(						__A    :							int = 1_000_000 )      ->					int:
    _UpperCAmelCase				:      Any			  =				prime_sieve(__A )
    _UpperCAmelCase				:      Optional[Any]			  =				0
    _UpperCAmelCase				:      Tuple			  =				0

    for i in range(len(__A ) ):
        for j in range(i + length		,		len(__A ) ):
            _UpperCAmelCase				:      List[Any]			  =				sum(primes[i:j] )
            if sol >= ceiling:
                break

            if sol in primes:
                _UpperCAmelCase				:      List[str]			  =				j - i
                _UpperCAmelCase				:      Optional[Any]			  =				sol

    return largest


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




