
    Given a binary string representing traffic congestion patterns across delivery checkpoints (where 1 indicates congestion and 0 indicates clear path), determine how many unique traffic pattern configurations result in an odd number of congested checkpoints when the pattern shifts n times throughout the day. Each shift rotates the entire pattern one position, simulating how traffic congestion moves along the delivery route over time.
    

    
def odd_Equivalent(s, n):
    """
    Given a binary string representing traffic congestion patterns across delivery checkpoints (where 1 indicates congestion and 0 indicates clear path), determine how many unique traffic pattern configurations result in an odd number of congested checkpoints when the pattern shifts n times throughout the day. Each shift rotates the entire pattern one position, simulating how traffic congestion moves along the delivery route over time.
    

    """
def odd_Equivalent(s, n):
    """
    Given a binary string representing traffic congestion patterns across delivery checkpoints (where 1 indicates congestion and 0 indicates clear path), determine how many unique traffic pattern configurations result in an odd number of congested checkpoints when the pattern shifts n times throughout the day. Each shift rotates the entire pattern one position, simulating how traffic congestion moves along the delivery route over time.
    

    """
    count = 0
    for i in range(0, n):
        if s[i] == '1':
            count = count + 1
    return count