
    Given a user's event preference pattern represented as a binary string where 1 indicates interest and 0 indicates disinterest in different event categories, determine how many unique interest combinations would result in an odd decimal value when rotating the pattern n times. This analysis helps identify the number of viable event recommendation patterns that could be matched with other users in the system.
    

    
def odd_Equivalent(s, n):
    """
    Given a user's event preference pattern represented as a binary string where 1 indicates interest and 0 indicates disinterest in different event categories, determine how many unique interest combinations would result in an odd decimal value when rotating the pattern n times. This analysis helps identify the number of viable event recommendation patterns that could be matched with other users in the system.
    

    """
def odd_Equivalent(s, n):
    """
    Given a user's event preference pattern represented as a binary string where 1 indicates interest and 0 indicates disinterest in different event categories, determine how many unique interest combinations would result in an odd decimal value when rotating the pattern n times. This analysis helps identify the number of viable event recommendation patterns that could be matched with other users in the system.
    

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