
    Given a binary string representing traffic congestion patterns across delivery routes (where 1 indicates congestion and 0 indicates clear routes), determine how many different time periods during the day will result in unfavorable routing conditions when the traffic pattern shifts according to typical daily flow changes. Each shift represents a predictable change in traffic patterns throughout the delivery window, and an unfavorable condition occurs when the decimal 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 routes), determine how many different time periods during the day will result in unfavorable routing conditions when the traffic pattern shifts according to typical daily flow changes. Each shift represents a predictable change in traffic patterns throughout the delivery window, and an unfavorable condition occurs when the decimal 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 routes), determine how many different time periods during the day will result in unfavorable routing conditions when the traffic pattern shifts according to typical daily flow changes. Each shift represents a predictable change in traffic patterns throughout the delivery window, and an unfavorable condition occurs when the decimal value of the shifted pattern is odd.
    

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