#!/usr/bin/env python3

# Challenge 289
#
# Task 2: Jumbled Letters
# Submitted by: Ryan Thompson
#
# An Internet legend dating back to at least 2001 goes something like this:
#
#     Aoccdrnig to a rscheearch at Cmabrigde Uinervtisy, it deosn't mttaer in
#     waht oredr the ltteers in a wrod are, the olny iprmoetnt tihng is taht
#     the frist and lsat ltteer be at the rghit pclae. The rset can be a toatl
#     mses and you can sitll raed it wouthit porbelm. Tihs is bcuseae the huamn
#     mnid deos not raed ervey lteter by istlef, but the wrod as a wlohe.
#
# This supposed Cambridge research is unfortunately an urban legend. However,
# the effect has been studied. For example-and with a title that probably made
# the journal's editor a little nervous-Raeding wrods with jubmled lettres:
# there is a cost by Rayner, White, et. al. looked at reading speed and
# comprehension of jumbled text.
#
# Your task is to write a program that takes English text as its input and
# outputs a jumbled version as follows:
#
#     The first and last letter of every word must stay the same
#     The remaining letters in the word are scrambled in a random order
#     (if that happens to be the original order, that is OK).
#     Whitespace, punctuation, and capitalization must stay the same
#     The order of words does not change, only the letters inside the word
#
# So, for example, "Perl" could become "Prel", or stay as "Perl," but it could
# not become "Pelr" or "lreP".
#
# I don't know if this effect has been studied in other languages besides
# English, but please consider sharing your results if you try!

import sys
import random
import re

if len(sys.argv) > 1:
    random.seed(int(sys.argv[1]))

for line in sys.stdin:
    def shuffle_inner(match):
        return match.group(1) + ''.join(random.sample(match.group(2), len(match.group(2)))) + match.group(3)

    line = re.sub(r'(\w)(\w*)(\w)', shuffle_inner, line)
    print(line, end='')