#!/usr/bin/env python3
+import functools
import math
from typing import List
from heapq import heappush, heappop
return int(n * multiplier) / multiplier
+@functools.lru_cache(maxsize=1024, typed=True)
def is_prime(n: int) -> bool:
"""Returns True if n is prime and False otherwise"""
if not isinstance(n, int):