Harder, Better, Faster, Einops: A simple coding puzzle

The vocal samples in Daft Punk's classic "Harder, Better, Faster, Stronger" consists of the same 16 samples rearranged into two major orderings.

"Work It, Make It, Do It, Makes Us, Harder, Better, Faster, Stronger, More Than, Hour, Our, Never, Ever, After, Work Is, Over"

and

"Work It, Harder, Make It, Better, Do It, Faster, Makes Us, Stronger, More Than, Ever, Hour, After, Our, Work Is, Never, Over"

A DJ has a pad controller with the samples shown as an 8 by 2 matrix so that the first ordering can be played by going across then down in the expected manner. The DJ is exceptionally lazy and asks that you rearrange into a second matrix so that he can play the second ordering by also going left-to-right, top-to-bottom. That is, he wants you to transform one 8 by 2 matrix into a different 8 by 2 matrix.

Your task:
We can label each sample by it's position in the first ordering, in which case it is written as "0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15".

You've been given the tensor corresponding to the first button arrangement.
```
tensor([ [ 0, 1],
[ 2, 3],
[ 4, 5],
[ 6, 7],
[ 8, 9],
[10, 11],
[12, 13],
[14, 15]])
```

Give the einops commands that will transform this into a tensor corresponding to the second arrangement of the lyrics.