Question: 
Write a python function to find the count of rotations of a binary string with odd value.


Model's Code:
def odd_Equivalent(s, n):
    count = 0
    for i in range(n):
        rotated = s[i:] + s[:i]
        if int(rotated, 2) % 2 != 0:
            count += 1
    return count



Sample Correct Code:
def odd_Equivalent(s,n): 
    count=0
    for i in range(0,n): 
        if (s[i] == '1'): 
            count = count + 1
    return count 


Asserts:
assert odd_Equivalent("011001",6) == 3
assert odd_Equivalent("11011",5) == 4
assert odd_Equivalent("1010",4) == 2


Tests:
Test 1 of 3: PASS
Test 2 of 3: PASS
Test 3 of 3: PASS

Test 109 of 974: 83/109 (76.14678899082568%): success