Help reorder the alphabet 4

Line up the $26$ letters in the alphabet randomly in a line. The alphabet letters are not necessarily in sorted order. To bring the letters back into sorted order, you are only allowed to swap two letters, or cycle three letters. For example, you can cycle the letters $a,b,c$ by sending $a$ to $b$ , $b$ to $c$ and $c$ to $a$ . You can swap the two letters $a,b$ by sending $a$ to $b$ , and $b$ to $a$ .

What is the total maximum number of swaps and three-cycles you need to bring the letters back to sorted order. If you may never be able to bring the letters back into sorted order, submit $-1$ .

Note: By "total" we mean the combined number of swaps and three-cycles. For example, if you can re-arrange a certain permutation with $11$ swaps and $4$ three-cycles, but you can also re-arrange the same permutation with $6$ swaps and $7$ three-cycles, then you need at most $6+7=13$ total swaps and three-cycles for that permutation (since $6+7 < 11 + 4$ ).