def solve(a, n):
    arr = list(a[:n])

    def merge_count(x):
        m = len(x)
        if m <= 1:
            return x, 0
        mid = m // 2
        left, inv_left = merge_count(x[:mid])
        right, inv_right = merge_count(x[mid:])
        i = j = 0
        merged = []
        inv = 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 += len(left) - i
                j += 1
        if i < len(left):
            merged.extend(left[i:])
        if j < len(right):
            merged.extend(right[j:])
        return merged, inv

    _, inv_standard = merge_count(arr)

    inv_adjacent = 0
    b = arr[:]
    for i in range(n):
        for j in range(0, n - i - 1):
            if b[j] > b[j + 1]:
                b[j], b[j + 1] = b[j + 1], b[j]
                inv_adjacent += 1

    return inv_standard == inv_adjacent