def is_perfect_square(n: int) -> bool:
    if n < 0: return False

    k = 0
    while k * k <= n:
        if k * k == n:
            return True
        k+=1
    return False