def solve(a, n):
    inversion_count = 0
    reverse_inversion_count = 0

    for i in range(n):
        for j in range(i + 1, n):
            if a[i] > a[j]:
                inversion_count += 1
            elif a[i] < a[j]:
                reverse_inversion_count += 1

    return inversion_count == reverse_inversion_count