def is_perfect_square(n: int) -> bool:
    i = 0
    while i * i <= n:
        if i * i == n:
            return True
        i += 1
    return False