Archery

An archery tournament is held according to the following rules. There are $n$ targets arranged in a line, numbered from $1$ to $n$ from left to right (the leftmost target is $1$, the rightmost is $n$). There are also $2n$ archers. At any time, two archers stand on each target. Each round proceeds as follows:

- The two archers on each target compete, determining a winner and a loser. Then all archers are rearranged: - Winners on targets $2$ to $n$ move to the target on their left (i.e., to targets $1$ to n-1). - Losers on targets $2$ to $n$ and the winner on target $1$ remain on their targets. - The loser on target $1$ moves to target $n$.

The tournament lasts $r$ rounds, where r \geq 2n.

You are the only archer to arrive exactly on time. The other 2n-1 archers have already arrived and are in line from left to right. You now insert yourself somewhere in the line. After you take your position, the two leftmost archers start on target $1$, the next two on target $2$, and so on, with the two rightmost on target $n$.

Each archer is assigned a unique rank based on skill; smaller rank is better. No two archers have the same rank. An archer with a smaller rank always wins.

You want to insert yourself so that you finish the tournament on the smallest possible target number. If there is more than one way, you prefer to start on the largest possible target number.

Write a program that, given the ranks of all archers (including you) and the arrangement of your competitors, determines on which target you should start the tournament to achieve your goal.