
    Design a function for an automated grading system that evaluates student understanding of prime numbers by calculating how many prime numbers exist below a given test number. The function should take a non-negative test number as input and return the count of prime numbers that are less than this test number, enabling the system to verify student responses and assess their comprehension of prime number concepts.
    

    
def count_Primes_nums(n):
    """
    Design a function for an automated grading system that evaluates student understanding of prime numbers by calculating how many prime numbers exist below a given test number. The function should take a non-negative test number as input and return the count of prime numbers that are less than this test number, enabling the system to verify student responses and assess their comprehension of prime number concepts.
    

    """
def count_Primes_nums(n):
    """
    Design a function for an automated grading system that evaluates student understanding of prime numbers by calculating how many prime numbers exist below a given test number. The function should take a non-negative test number as input and return the count of prime numbers that are less than this test number, enabling the system to verify student responses and assess their comprehension of prime number concepts.
    

    """
    ctr = 0
    for num in range(n):
        if num <= 1:
            continue
        for i in range(2, num):
            if num % i == 0:
                break
        else:
            ctr += 1
    return ctr