
    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 numerical answer. The function should accept the student's submitted number as input and return the count of all prime numbers that are less than the given number, helping assess if the student comprehends the concept of prime number distribution.
    

    
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 numerical answer. The function should accept the student's submitted number as input and return the count of all prime numbers that are less than the given number, helping assess if the student comprehends the concept of prime number distribution.
    

    """
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 numerical answer. The function should accept the student's submitted number as input and return the count of all prime numbers that are less than the given number, helping assess if the student comprehends the concept of prime number distribution.
    

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