
    Design a function that determines how many unique friend matches can be found by rotating a user's binary interest profile, where each rotation represents a different alignment of shared interests between users. Given a binary string representing a user's interests and the number of profile comparisons needed, calculate how many of these rotated interest patterns would result in an odd decimal value, indicating a potentially strong friend match.
    

    
def odd_Equivalent(s, n):
    """
    Design a function that determines how many unique friend matches can be found by rotating a user's binary interest profile, where each rotation represents a different alignment of shared interests between users. Given a binary string representing a user's interests and the number of profile comparisons needed, calculate how many of these rotated interest patterns would result in an odd decimal value, indicating a potentially strong friend match.
    

    """
def odd_Equivalent(s, n):
    """
    Design a function that determines how many unique friend matches can be found by rotating a user's binary interest profile, where each rotation represents a different alignment of shared interests between users. Given a binary string representing a user's interests and the number of profile comparisons needed, calculate how many of these rotated interest patterns would result in an odd decimal value, indicating a potentially strong friend match.
    

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