Sum the Ino-Numbers!

def In_no(n):
    if n < n**2:
        return n**2 - n

    if n >  n**2:
        if n > n / 2:
            return n + n /2
        elif n < n /2 :
            return 2 * n
        elif n + 1 < n:
            return abs(n)
        else:
            return n + 2 - n*2 + n /2

    return n - n**2 / (n + 1)

Sum = 0

_loc1_ = 0
while _loc1_ < 11:
    _loc2_ = 1
    while _loc2_ < 11:
        Sum += In_no(_loc1_ / float(_loc2_))
        _loc2_ += 1

    _loc1_ += 1
print round(Sum)