
    Design a function for an automated grading system that evaluates a student's understanding of prime numbers by determining how many prime numbers exist below their submitted test value. The function should accept a non-negative integer representing the student's input threshold and return the count of all prime numbers that are strictly less than this threshold. The solution will be used to provide immediate feedback in an online learning platform's programming exercises.
    

    
def count_Primes_nums(n):
    """
    Design a function for an automated grading system that evaluates a student's understanding of prime numbers by determining how many prime numbers exist below their submitted test value. The function should accept a non-negative integer representing the student's input threshold and return the count of all prime numbers that are strictly less than this threshold. The solution will be used to provide immediate feedback in an online learning platform's programming exercises.
    

    """
def count_Primes_nums(n):
    """
    Design a function for an automated grading system that evaluates a student's understanding of prime numbers by determining how many prime numbers exist below their submitted test value. The function should accept a non-negative integer representing the student's input threshold and return the count of all prime numbers that are strictly less than this threshold. The solution will be used to provide immediate feedback in an online learning platform's programming exercises.
    

    """
    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