
    Given a student's binary attendance record where '1' represents present and '0' represents absent, determine how many unique attendance patterns would flag as concerning when the record is analyzed across different academic periods by rotating the pattern. The number of concerning patterns is determined by converting each rotated attendance sequence to its decimal equivalent and counting those that result in odd values, which could indicate irregular attendance behavior potentially leading to dropout risk.
    

    
def odd_Equivalent(s, n):
    """
    Given a student's binary attendance record where '1' represents present and '0' represents absent, determine how many unique attendance patterns would flag as concerning when the record is analyzed across different academic periods by rotating the pattern. The number of concerning patterns is determined by converting each rotated attendance sequence to its decimal equivalent and counting those that result in odd values, which could indicate irregular attendance behavior potentially leading to dropout risk.
    

    """
def odd_Equivalent(s, n):
    """
    Given a student's binary attendance record where '1' represents present and '0' represents absent, determine how many unique attendance patterns would flag as concerning when the record is analyzed across different academic periods by rotating the pattern. The number of concerning patterns is determined by converting each rotated attendance sequence to its decimal equivalent and counting those that result in odd values, which could indicate irregular attendance behavior potentially leading to dropout risk.
    

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