
    Given a user's social event participation pattern represented as a binary string where 1 indicates active participation and 0 indicates non-participation, determine how many unique ways of viewing this pattern across different time periods result in an odd number of total participations. The pattern can be rotated n times, where each rotation shifts the entire participation history by one position, and you need to count how many of these rotated patterns, when converted to decimal, yield an odd number.
    

    
def odd_Equivalent(s, n):
    """
    Given a user's social event participation pattern represented as a binary string where 1 indicates active participation and 0 indicates non-participation, determine how many unique ways of viewing this pattern across different time periods result in an odd number of total participations. The pattern can be rotated n times, where each rotation shifts the entire participation history by one position, and you need to count how many of these rotated patterns, when converted to decimal, yield an odd number.
    

    """
def odd_Equivalent(s, n):
    """
    Given a user's social event participation pattern represented as a binary string where 1 indicates active participation and 0 indicates non-participation, determine how many unique ways of viewing this pattern across different time periods result in an odd number of total participations. The pattern can be rotated n times, where each rotation shifts the entire participation history by one position, and you need to count how many of these rotated patterns, when converted to decimal, yield an odd number.
    

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