Sorted array

You are given the following:

An Integer $N$

An array A consisting of $N$ integers

Where each integer from $1$ to $N$ appears exactly once in array $A.$ An index $)i(n$ is special if there exists at least ${|}_{{?}_{?}}\frac{A_i}{(2{)}_{{?}_{?}}}|$ elements less than $A_i$ in index range $1$ to $i-1.$

It is possible to swap $i_{th}$ element with $(i+1{)}_{th},$ if both are special indices. You may perform any number of swapping operations in any order. There is no limit on the number of times you swap $i_{th}$ element with $(i+1{)}_{th}($if the position is not forbidden$).$

Task

Determine whether you can make this array sorted in ascending order by performing some sequence of swapping operations.

Notes

An index is special or not is decided before performing any special operation.

${|}_{{?}_{?}}{x}_{{?}_{?}}|$ greatest integer less than or equal to $x.$