
    Given a user's social interaction pattern represented as a binary string where 1 indicates active interaction and 0 indicates no interaction, determine how many unique ways of viewing their interaction pattern (through rotations) result in an odd number of total interactions. The number of rotations to analyze is specified by n, and each rotation shifts the pattern one position to the right, with the rightmost bit moving to the leftmost position.
    

    
def odd_Equivalent(s, n):
    """
    Given a user's social interaction pattern represented as a binary string where 1 indicates active interaction and 0 indicates no interaction, determine how many unique ways of viewing their interaction pattern (through rotations) result in an odd number of total interactions. The number of rotations to analyze is specified by n, and each rotation shifts the pattern one position to the right, with the rightmost bit moving to the leftmost position.
    

    """
def odd_Equivalent(s, n):
    """
    Given a user's social interaction pattern represented as a binary string where 1 indicates active interaction and 0 indicates no interaction, determine how many unique ways of viewing their interaction pattern (through rotations) result in an odd number of total interactions. The number of rotations to analyze is specified by n, and each rotation shifts the pattern one position to the right, with the rightmost bit moving to the leftmost position.
    

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