
    Design a function for the bank's fraud detection system that determines how many unique fraud pattern identifiers exist below a given pattern threshold number, where each identifier must be a prime number in the bank's security protocol. The function should take a non-negative threshold value as input and return the count of valid fraud pattern identifiers that fall below this threshold.
    

    
def count_Primes_nums(n):
    """
    Design a function for the bank's fraud detection system that determines how many unique fraud pattern identifiers exist below a given pattern threshold number, where each identifier must be a prime number in the bank's security protocol. The function should take a non-negative threshold value as input and return the count of valid fraud pattern identifiers that fall below this threshold.
    

    """
def count_Primes_nums(n):
    """
    Design a function for the bank's fraud detection system that determines how many unique fraud pattern identifiers exist below a given pattern threshold number, where each identifier must be a prime number in the bank's security protocol. The function should take a non-negative threshold value as input and return the count of valid fraud pattern identifiers that fall below this threshold.
    

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