
    Given a binary sequence representing traffic congestion patterns along a delivery route, where 1 indicates congestion and 0 indicates clear traffic, determine how many unique route variations will result in unfavorable delivery conditions when the pattern is shifted n times throughout the day. Each shift represents a time-based adjustment of the traffic pattern, and an unfavorable condition occurs when the decimal value of the shifted pattern is odd.
    

    
def odd_Equivalent(s, n):
    """
    Given a binary sequence representing traffic congestion patterns along a delivery route, where 1 indicates congestion and 0 indicates clear traffic, determine how many unique route variations will result in unfavorable delivery conditions when the pattern is shifted n times throughout the day. Each shift represents a time-based adjustment of the traffic pattern, and an unfavorable condition occurs when the decimal value of the shifted pattern is odd.
    

    """
def odd_Equivalent(s, n):
    """
    Given a binary sequence representing traffic congestion patterns along a delivery route, where 1 indicates congestion and 0 indicates clear traffic, determine how many unique route variations will result in unfavorable delivery conditions when the pattern is shifted n times throughout the day. Each shift represents a time-based adjustment of the traffic pattern, 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