def find_odd(lst):
    i = 0
    while i + 1 <= len(lst):
        count = 0
        num = lst[i]
        # Hasta aca funciona
        for elm in lst:
            if elm == num:
                # print(elm, num)
                count += 1
        # print(count - int(count))
        count = count/2
        if not (count - int(count) == 0):
            print(count/2, num, type(count/2))
            return num
        i += 1


find_odd([1, 1, 2, -2, 5, 2, 4, 4, -1, -2, 5])

d75937a378ccba939502995151bbc1f0ce404914
<mask token>

def find_odd(lst):
    i = 0
    while i + 1 <= len(lst):
        count = 0
        num = lst[i]
        for elm in lst:
            if elm == num:
                count += 1
        count = count / 2
        if not count - int(count) == 0:
            print(count / 2, num, type(count / 2))
            return num
        i += 1


<mask token>

def find_odd(lst):
    i = 0
    while i + 1 <= len(lst):
        count = 0
        num = lst[i]
        for elm in lst:
            if elm == num:
                count += 1
        count = count / 2
        if not count - int(count) == 0:
            print(count / 2, num, type(count / 2))
            return num
        i += 1


find_odd([1, 1, 2, -2, 5, 2, 4, 4, -1, -2, 5])

def find_odd(lst):
    i = 0
    while i + 1 <= len(lst):
        count = 0
        num = lst[i]
        # Hasta aca funciona
        for elm in lst:
            if elm == num:
                # print(elm, num)
                count += 1
        # print(count - int(count))
        count = count/2
        if not (count - int(count) == 0):
            print(count/2, num, type(count/2))
            return num
        i += 1


find_odd([1, 1, 2, -2, 5, 2, 4, 4, -1, -2, 5])
