
    Given a binary sequence representing the current status of bus stops (1 for active stops with waiting passengers, 0 for inactive stops), determine how many different route configurations would result in an odd number of active stops when rotating the sequence n times to accommodate changing passenger patterns. The route configuration can be rotated left or right, and each rotation represents a potential adjustment to the bus route based on real-time demand.
    

    
def odd_Equivalent(s, n):
    """
    Given a binary sequence representing the current status of bus stops (1 for active stops with waiting passengers, 0 for inactive stops), determine how many different route configurations would result in an odd number of active stops when rotating the sequence n times to accommodate changing passenger patterns. The route configuration can be rotated left or right, and each rotation represents a potential adjustment to the bus route based on real-time demand.
    

    """
def odd_Equivalent(s, n):
    """
    Given a binary sequence representing the current status of bus stops (1 for active stops with waiting passengers, 0 for inactive stops), determine how many different route configurations would result in an odd number of active stops when rotating the sequence n times to accommodate changing passenger patterns. The route configuration can be rotated left or right, and each rotation represents a potential adjustment to the bus route based on real-time demand.
    

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