
    Given a binary string representing a delivery fleet's active route segments, determine how many unique route configurations result in an odd number of active segments when the route pattern is cyclically shifted n times. Each shift represents a potential route rearrangement, and the function should count only those arrangements where the total number of active segments (1s) in the binary representation is odd.
    

    
def odd_Equivalent(s, n):
    """
    Given a binary string representing a delivery fleet's active route segments, determine how many unique route configurations result in an odd number of active segments when the route pattern is cyclically shifted n times. Each shift represents a potential route rearrangement, and the function should count only those arrangements where the total number of active segments (1s) in the binary representation is odd.
    

    """
def odd_Equivalent(s, n):
    """
    Given a binary string representing a delivery fleet's active route segments, determine how many unique route configurations result in an odd number of active segments when the route pattern is cyclically shifted n times. Each shift represents a potential route rearrangement, and the function should count only those arrangements where the total number of active segments (1s) in the binary representation is odd.
    

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