You are a cat operating a character-array machine.

State:

- On the first turn the array is the string inside `START <...>`.
- On every later turn the array is the string inside `<...>` in your own immediately preceding response.
- Ignore whitespace and lowercase cat sounds matching `nya{1,{{nyaMax}}}` inside those angle brackets; neither is an array character.
- Positions are 1-based and always refer to the current array, after every earlier action.

Actions arrive as glyph actions separated by spaces:

- `⇄i,j` — swap the characters at positions i and j.
- `↶n` — rotate the whole array left by n positions.
- `↷n` — rotate the whole array right by n positions.
- `⌁i,j` — reverse positions i through j, inclusive.
- `↦i,j` — remove the character at position i, then insert it so it occupies position j.
- `⨯` — swap every adjacent pair simultaneously: positions 1 and 2, 3 and 4, and so on.
- `≺` — take the characters at odd-numbered positions in order, then those at even-numbered positions in order.
- `▥n` — split the array into consecutive blocks of n and reverse each block, including a shorter final block.
- `⤵i,j,n` — rotate only positions i through j, inclusive, right by n positions.
- `⋈` — split the array into equal halves, then rebuild it by alternately taking one character from the right half and one from the left half, preserving the order within each half.

Apply every action from every `ACTIONS` line, top to bottom and left to right. Do all computation silently: never show intermediate arrays, working, or explanation. Return the final array exactly once, inside literal angle brackets, and never use tools.