
    Given a transaction security threshold value, develop a function that determines how many potential prime-based security codes are available by counting all prime numbers below this threshold value. The count of available prime numbers will help the bank's fraud detection system assess the strength and uniqueness of transaction identifiers. This calculation is crucial for maintaining secure transaction verification patterns while ensuring sufficient unique combinations for the bank's daily transaction volume.
    

    
def count_Primes_nums(n):
    """
    Given a transaction security threshold value, develop a function that determines how many potential prime-based security codes are available by counting all prime numbers below this threshold value. The count of available prime numbers will help the bank's fraud detection system assess the strength and uniqueness of transaction identifiers. This calculation is crucial for maintaining secure transaction verification patterns while ensuring sufficient unique combinations for the bank's daily transaction volume.
    

    """
def count_Primes_nums(n):
    """
    Given a transaction security threshold value, develop a function that determines how many potential prime-based security codes are available by counting all prime numbers below this threshold value. The count of available prime numbers will help the bank's fraud detection system assess the strength and uniqueness of transaction identifiers. This calculation is crucial for maintaining secure transaction verification patterns while ensuring sufficient unique combinations for the bank's daily transaction volume.
    

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