/prog/ challenge #6001: FIOC

Input: A four-letter ASCII string
Output: The phrase ``αorced αndendation αf αode'',
with the alphae replaced with the consecutive letters from the input, shifted to uppercase.
╔═══════════════════════════════════════════════
║Example 1: sicp -> Sorced Indendation Cf Pode
║Example 2: SUSS -> Sorced Undendation Sf Sode
╚═══════════════════════════════════════════════

Your entry has to be a

source code

of a complete program
that takes the input on stdin and outputs the string to stdout. Shortest program wins.

destructuring bind and type conversions are just too verbose in common lisp

(destructuring-bind(a b c d)(coerce(string-upcase(read))'list)(format nil"~Aorced ~Andentation ~Af ~Aode"a b c d))