
    Design a function that determines how many unique event recommendation patterns would appeal to a user when their interest profile is cyclically shifted, where each pattern's binary representation must have an odd decimal value to be considered viable. The function takes a binary string representing the user's current interest pattern across event categories and the number of recommendation cycles to analyze, with each cycle performing one rotation of the interest pattern.
    

    
def odd_Equivalent(s, n):
    """
    Design a function that determines how many unique event recommendation patterns would appeal to a user when their interest profile is cyclically shifted, where each pattern's binary representation must have an odd decimal value to be considered viable. The function takes a binary string representing the user's current interest pattern across event categories and the number of recommendation cycles to analyze, with each cycle performing one rotation of the interest pattern.
    

    """
def odd_Equivalent(s, n):
    """
    Design a function that determines how many unique event recommendation patterns would appeal to a user when their interest profile is cyclically shifted, where each pattern's binary representation must have an odd decimal value to be considered viable. The function takes a binary string representing the user's current interest pattern across event categories and the number of recommendation cycles to analyze, with each cycle performing one rotation of the interest pattern.
    

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