def solve(a, n):
    count1 = 0  # inversions where a[i] > a[j] (i < j)
    count2 = 0  # inversions where a[i] < a[j] (i < j)
    
    for i in range(n):
        for j in range(i + 1, n):
            if a[i] > a[j]:
                count1 += 1
            elif a[i] < a[j]:
                count2 += 1
    
    return count1 == count2