Everyone is a little lazy sometimes. It is unpleasant when you need to do something burdensome in moments of laziness. We hope that you are not so idle right now, because in this task you need to:
Calculate the Damerau-Levenshtein distance between the string of English alphabet letters 'abcdefghijklmnopqrstuvwxyz' and the opposite of it, 'zyxwvutsrqponmlkjihgfedcba'.
If you are a bit lazy, can you come up with a short approach to calculate the distance between the two strings and output it, without counting it manually?