Prime seieve GDScript

extends Node

@export var limit :int = 25000

func is_prime(n :int) -> int:
    for i :int in range(2, n/2 + 1):
        if n % i == 0:
            return 0
    return 1

func how_many_primes(p_limit: int) -> int:
    var numPrimes :int = 0
    for i :int in range(2, p_limit):
        numPrimes += is_prime(i)
    prints(numPrimes)
    return numPrimes