
    Design a fraud detection function that determines how many unique verification checkpoints can be established within a sequence of n credit card transactions, where each checkpoint must correspond to a prime number position in the transaction sequence. The function should take the total number of transactions n as input and return the count of possible verification checkpoints that can be established.
    

    
def count_Primes_nums(n):
    """
    Design a fraud detection function that determines how many unique verification checkpoints can be established within a sequence of n credit card transactions, where each checkpoint must correspond to a prime number position in the transaction sequence. The function should take the total number of transactions n as input and return the count of possible verification checkpoints that can be established.
    

    """
def count_Primes_nums(n):
    """
    Design a fraud detection function that determines how many unique verification checkpoints can be established within a sequence of n credit card transactions, where each checkpoint must correspond to a prime number position in the transaction sequence. The function should take the total number of transactions n as input and return the count of possible verification checkpoints that can be established.
    

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