Find Permutation

You are given an array $A$ of length $2\cdot N$ consisting of **exactly two** occurrences of each integer from $1$ to $N$. Find a *permutation* $P$ of length $N$, such that, for each $1 \le i \le N$: - If we delete **both** occurrences of $P_j$ **for all** $i \lt j \leq N$ from $A$ without changing the order of remaining elements, there will be **atmost** $\frac{|A|}{2}$ elements between both occ