
    Given a binary string representing bus route segments with high (1) and low (0) passenger density, determine how many different route configurations, when rotated n times, result in an odd number of high-density segments. Each rotation represents a potential route adjustment during different times of the day, and the count of odd-valued configurations helps identify optimal timing for route modifications.
    

    
def odd_Equivalent(s, n):
    """
    Given a binary string representing bus route segments with high (1) and low (0) passenger density, determine how many different route configurations, when rotated n times, result in an odd number of high-density segments. Each rotation represents a potential route adjustment during different times of the day, and the count of odd-valued configurations helps identify optimal timing for route modifications.
    

    """
def odd_Equivalent(s, n):
    """
    Given a binary string representing bus route segments with high (1) and low (0) passenger density, determine how many different route configurations, when rotated n times, result in an odd number of high-density segments. Each rotation represents a potential route adjustment during different times of the day, and the count of odd-valued configurations helps identify optimal timing for route modifications.
    

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