From the edges inwards

You are given an array of $n$ numbers. Print its elements in this order: first, last, second, second to last, and so on — $a_1, a_n, a_2, a_{n-1}, a_3, \ldots$

The first line contains $n$ ($1 \le n \le 10^5$). The second line contains $n$ integers $a_1, \ldots, a_n$ ($|a_i| \le 10^9$).

A single line with $n$ numbers — each element exactly once.

Use two indices: one from the start ($l$) and one from the end ($r$). Print $a_l$ and $a_r$ in turn and move them towards the middle. When $n$ is odd, the middle element is printed once: 1 5 2 4 3 in the first example.