def get_Inv_Count(arr, n):
    def merge_sort_count(a):
        length = len(a)
        if length <= 1:
            return a, 0

        mid = length // 2
        left, inv_left = merge_sort_count(a[:mid])
        right, inv_right = merge_sort_count(a[mid:])

        merged = []
        i = j = 0
        inv_count = inv_left + inv_right

        while i < len(left) and j < len(right):
            if left[i] <= right[j]:
                merged.append(left[i])
                i += 1
            else:
                merged.append(right[j])
                inv_count += len(left) - i
                j += 1

        merged.extend(left[i:])
        merged.extend(right[j:])

        return merged, inv_count

    _, count = merge_sort_count(arr[:n])
    return count