
    Given a user's daily social media engagement pattern represented as a binary string (where 1 indicates active engagement and 0 indicates no engagement), determine how many unique temporal shifts of this pattern would result in an odd number of total engagements when interpreted as a binary number. The pattern can be shifted up to n times, where each shift represents analyzing the engagement sequence from a different starting point.
    

    
def odd_Equivalent(s, n):
    """
    Given a user's daily social media engagement pattern represented as a binary string (where 1 indicates active engagement and 0 indicates no engagement), determine how many unique temporal shifts of this pattern would result in an odd number of total engagements when interpreted as a binary number. The pattern can be shifted up to n times, where each shift represents analyzing the engagement sequence from a different starting point.
    

    """
def odd_Equivalent(s, n):
    """
    Given a user's daily social media engagement pattern represented as a binary string (where 1 indicates active engagement and 0 indicates no engagement), determine how many unique temporal shifts of this pattern would result in an odd number of total engagements when interpreted as a binary number. The pattern can be shifted up to n times, where each shift represents analyzing the engagement sequence from a different starting point.
    

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