import re
s=""
for w in re.split(r"(\w+)",input()):
 if w.isalpha():
  f=w[0]
  O="oe"[f.lower()in"aeiouy"]*2+"k"
  if f==f.upper():O=O.capitalize()
  s+=O
 else:s+=w
print(s)

import itertools as i
s=input()
k=int(input())
S=set()
for c in i.combinations(s,k):
    S.add(''.join(c))
print('\n'.join(sorted(S)))

import itertools as i
S=set(''.join(c)for c in i.combinations(input(),int(input())))
print('\n'.join(sorted(S)))

lambda s,k:list(map("".join,combinations(s,k)));from itertools import*
f=lambda s,k:k>=0and(k==len(s)and[s]or[s[0]+S for S in f(s[1:],k-1)]+f(s[1:],k))or[]

s=0
for c in input():
 if c==".":print(chr(s),end='')
 if c=="+":s+=1
 if c=="-":s-=1

s=0
for c in input():
 if c==".":print(chr(s),end='')
 if c in"-+":s-=ord(c)-44

s=0
for i in input():print(chr(s)*(i=="."),end="");s+="-+".find(i)*2%3-1

print(''.join(chr(int(k))for k in input().split()))

gets.split(" ").each{|x| print x.to_i.chr}

def f n
i=[]
n.times{i<<[]}
i
end

def f a,d
d.times{a=a[0]}
a
end

Àñ          " Arg1 times...
  d         "   Delete
   t        "   unTil
    [       "   The next occurrence of '['
     %      "   Move the bracket that matches the character under the cursor
      l     "   Move one character to the right
       D    "   Delete everything after the cursor on this line
        |   "   Move to the first character on this line