
    Given a binary string representing traffic congestion patterns along delivery routes (where 1 indicates congestion and 0 indicates clear path), determine how many alternative route configurations would result in unfavorable delivery conditions when the traffic pattern is shifted n times. Each shift represents a potential route reconfiguration, and the resulting binary value being odd indicates an unfavorable delivery condition.
    

    
def odd_Equivalent(s, n):
    """
    Given a binary string representing traffic congestion patterns along delivery routes (where 1 indicates congestion and 0 indicates clear path), determine how many alternative route configurations would result in unfavorable delivery conditions when the traffic pattern is shifted n times. Each shift represents a potential route reconfiguration, and the resulting binary value being odd indicates an unfavorable delivery condition.
    

    """
def odd_Equivalent(s, n):
    """
    Given a binary string representing traffic congestion patterns along delivery routes (where 1 indicates congestion and 0 indicates clear path), determine how many alternative route configurations would result in unfavorable delivery conditions when the traffic pattern is shifted n times. Each shift represents a potential route reconfiguration, and the resulting binary value being odd indicates an unfavorable delivery condition.
    

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