
    Given a binary string representing traffic congestion patterns across delivery routes (where 1 indicates congestion and 0 indicates clear roads), determine how many unique traffic scenarios would result in problematic delivery conditions when the pattern shifts n times throughout the delivery window. Each shift rotates the entire traffic pattern one position, and a scenario is considered problematic if the binary value of the shifted pattern is odd.
    

    
def odd_Equivalent(s, n):
    """
    Given a binary string representing traffic congestion patterns across delivery routes (where 1 indicates congestion and 0 indicates clear roads), determine how many unique traffic scenarios would result in problematic delivery conditions when the pattern shifts n times throughout the delivery window. Each shift rotates the entire traffic pattern one position, and a scenario is considered problematic if the binary value of the shifted pattern is odd.
    

    """
def odd_Equivalent(s, n):
    """
    Given a binary string representing traffic congestion patterns across delivery routes (where 1 indicates congestion and 0 indicates clear roads), determine how many unique traffic scenarios would result in problematic delivery conditions when the pattern shifts n times throughout the delivery window. Each shift rotates the entire traffic pattern one position, and a scenario is considered problematic if the binary value of the shifted pattern is odd.
    

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