
    Given an encoded traffic pattern represented as a binary string where 1 indicates congestion and 0 indicates clear traffic at checkpoints along a delivery route, determine how many times the traffic pattern will show unfavorable conditions after performing a specified number of temporal shifts. Each shift represents a route recalculation that rotates the traffic pattern to reflect changing conditions, and an unfavorable condition occurs when the decimal value of the rotated pattern is odd.
    

    
def odd_Equivalent(s, n):
    """
    Given an encoded traffic pattern represented as a binary string where 1 indicates congestion and 0 indicates clear traffic at checkpoints along a delivery route, determine how many times the traffic pattern will show unfavorable conditions after performing a specified number of temporal shifts. Each shift represents a route recalculation that rotates the traffic pattern to reflect changing conditions, and an unfavorable condition occurs when the decimal value of the rotated pattern is odd.
    

    """
def odd_Equivalent(s, n):
    """
    Given an encoded traffic pattern represented as a binary string where 1 indicates congestion and 0 indicates clear traffic at checkpoints along a delivery route, determine how many times the traffic pattern will show unfavorable conditions after performing a specified number of temporal shifts. Each shift represents a route recalculation that rotates the traffic pattern to reflect changing conditions, and an unfavorable condition occurs when the decimal value of the rotated pattern is odd.
    

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