
    Given a security threshold value for a banking fraud detection system, determine the total count of available prime numbers below this threshold that can be used as unique encryption keys for securing different transaction channels. The system requires this count to ensure there are enough unique prime-based keys to maintain distinct encryption patterns across all monitored transaction channels. The input threshold is guaranteed to be non-negative.
    

    
def count_Primes_nums(n):
    """
    Given a security threshold value for a banking fraud detection system, determine the total count of available prime numbers below this threshold that can be used as unique encryption keys for securing different transaction channels. The system requires this count to ensure there are enough unique prime-based keys to maintain distinct encryption patterns across all monitored transaction channels. The input threshold is guaranteed to be non-negative.
    

    """
def count_Primes_nums(n):
    """
    Given a security threshold value for a banking fraud detection system, determine the total count of available prime numbers below this threshold that can be used as unique encryption keys for securing different transaction channels. The system requires this count to ensure there are enough unique prime-based keys to maintain distinct encryption patterns across all monitored transaction channels. The input threshold is guaranteed to be non-negative.
    

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