/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.

>>30,33
actually, converting string to list makes it possible to use apply. this makes the CL version much shorter:
(apply #'format t"~aorced ~andentation ~af ~aode"(coerce(string-upcase(read))'list))

racket version also gets better, but not that much better:
(apply format "~aorced ~andentation ~af ~aode" (string->list(string-upcase(read-line))))