
    Given a binary pattern representing parking space occupancy in a lot, where 1 indicates occupied and 0 indicates vacant, determine how many unique hourly configurations result in an odd number of occupied spaces when the pattern shifts n times throughout the day. Each shift represents vehicles moving in or out of the lot during different time intervals, where the rightmost space becomes the leftmost space in the pattern.
    

    
def odd_Equivalent(s, n):
    """
    Given a binary pattern representing parking space occupancy in a lot, where 1 indicates occupied and 0 indicates vacant, determine how many unique hourly configurations result in an odd number of occupied spaces when the pattern shifts n times throughout the day. Each shift represents vehicles moving in or out of the lot during different time intervals, where the rightmost space becomes the leftmost space in the pattern.
    

    """
def odd_Equivalent(s, n):
    """
    Given a binary pattern representing parking space occupancy in a lot, where 1 indicates occupied and 0 indicates vacant, determine how many unique hourly configurations result in an odd number of occupied spaces when the pattern shifts n times throughout the day. Each shift represents vehicles moving in or out of the lot during different time intervals, where the rightmost space becomes the leftmost space in the pattern.
    

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