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

>>31
looking for other lisps in which it could be more terse. clojure's deconstructing bind available in a normal let expression and working natively on strings sounds like a good start but the uppercasing ruins it (although it still beats CL):
(let[[f i o c](clojure.string/upper-case(read-line))](print(format"%sorced %sndentation %sf %sode"f i o c)))

I'm gonna fuck around with scheme dialects now