//Kevin Siegl

//Enloe HS ACSL3

//INT-5

package ACSL3;

import java.util.ArrayList;

import java.util.Scanner;

public class Translator {

/**

* @param args

*/

public static void main(String[] args) {

for(int bah=0;bah<5;bah++)

{

String inp=getInput();

String[] words=inp.split(" ");

for(int bah2=0;bah2<words.length;bah2++)

{

System.out.print(transWord(words[bah2])+" ");

}

System.out.println();

}

}

public static String getInput()

{

Scanner s=new Scanner(System.in);

return s.nextLine();

}

public static String transWord(String s2)

{

StringNode s=new StringNode(null,null,s2,true);

StringNode curr=s;

while(curr!=null)

{

while(curr.val.contains("."))

{

int i=curr.val.indexOf(".");

String q=new String(curr.val);

curr.val=curr.val.substring(0, i);

StringNode rawr=new StringNode(curr,null,". BORK BORK BORK!",false);

StringNode rawr2=new StringNode(rawr,curr.next,q.substring(i+1,q.length()),true);

rawr.next=rawr2;

curr.next=rawr;

}

while(curr.val.contains("THE"))

{

int i=curr.val.indexOf("THE");

String q=new String(curr.val);

curr.val=curr.val.substring(0, i);

StringNode rawr=new StringNode(curr,null,"ZEE",false);

StringNode rawr2=new StringNode(rawr,curr.next,q.substring(i+3,q.length()),true);

rawr.next=rawr2;

curr.next=rawr;

}

while(curr.val.contains("AN"))

{

int i=curr.val.indexOf("AN");

String q=new String(curr.val);

curr.val=curr.val.substring(0, i);

StringNode rawr=new StringNode(curr,null,"UN",false);

StringNode rawr2=new StringNode(rawr,curr.next,q.substring(i+2,q.length()),true);

rawr.next=rawr2;

curr.next=rawr;

}

while(curr.val.contains("AU"))

{

int i=curr.val.indexOf("AU");

String q=new String(curr.val);

curr.val=curr.val.substring(0, i);

StringNode rawr=new StringNode(curr,null,"OO",false);

StringNode rawr2=new StringNode(rawr,curr.next,q.substring(i+2,q.length()),true);

rawr.next=rawr2;

curr.next=rawr;

}

while(curr.val.contains("A")&& ((curr.val.indexOf("A")!=curr.val.length()-1)|| curr.next!=null))

{

int i=curr.val.indexOf("A");

String q=new String(curr.val);

curr.val=curr.val.substring(0, i);

StringNode rawr=new StringNode(curr,null,"E",false);

StringNode rawr2=new StringNode(rawr,curr.next,q.substring(i+1,q.length()),true);

rawr.next=rawr2;

curr.next=rawr;

}

while(curr.val.contains("OW"))

{

int i=curr.val.indexOf("OW");

String q=new String(curr.val);

curr.val=curr.val.substring(0, i);

StringNode rawr=new StringNode(curr,null,"OO",false);

StringNode rawr2=new StringNode(rawr,curr.next,q.substring(i+2,q.length()),true);

rawr.next=rawr2;

curr.next=rawr;

}

while(curr.val.contains("TION"))

{

int i=curr.val.indexOf("TION");

String q=new String(curr.val);

curr.val=curr.val.substring(0, i);

StringNode rawr=new StringNode(curr,null,"SHUN",false);

StringNode rawr2=new StringNode(rawr,curr.next,q.substring(i+4,q.length()),true);

rawr.next=rawr2;

curr.next=rawr;

}

while(curr.val.contains("IR"))

{

int i=curr.val.indexOf("IR");

String q=new String(curr.val);

curr.val=curr.val.substring(0, i);

StringNode rawr=new StringNode(curr,null,"UR",false);

StringNode rawr2=new StringNode(rawr,curr.next,q.substring(i+2,q.length()),true);

rawr.next=rawr2;

curr.next=rawr;

}

while(curr.val.contains("O"))

{

int i=curr.val.indexOf("O");

String q=new String(curr.val);

curr.val=curr.val.substring(0, i);

StringNode rawr=new StringNode(curr,null,"U",false);

StringNode rawr2=new StringNode(rawr,curr.next,q.substring(i+1,q.length()),true);

rawr.next=rawr2;

curr.next=rawr;

}

if((curr.val.length()>0 && curr.val.substring(1).contains("I"))||(curr!=s && curr.val.contains("I")))

{

int i;

if(curr==s)

i=curr.val.substring(1).indexOf("I")+1;

else

i=curr.val.indexOf("I");

String q=new String(curr.val);

curr.val=curr.val.substring(0, i);

StringNode rawr=new StringNode(curr,null,"EE",false);

StringNode rawr2=new StringNode(rawr,curr.next,q.substring(i+1,q.length()),true);

rawr.next=rawr2;

curr.next=rawr;

}

if(curr.val.contains("EN")&& curr.val.lastIndexOf("EN")==curr.val.length()-2 && curr.next==null)

{

int i=curr.val.lastIndexOf("EN");

String q=new String(curr.val);

curr.val=curr.val.substring(0, i);

StringNode rawr=new StringNode(curr,null,"EE",false);

StringNode rawr2=new StringNode(rawr,curr.next,q.substring(i+2,q.length()),true);

rawr.next=rawr2;

curr.next=rawr;

}

while(curr.val.contains("F"))

{

int i=curr.val.indexOf("F");

String q=new String(curr.val);

curr.val=curr.val.substring(0, i);

StringNode rawr=new StringNode(curr,null,"FF",false);

StringNode rawr2=new StringNode(rawr,curr.next,q.substring(i+1,q.length()),true);

rawr.next=rawr2;

curr.next=rawr;

}

if(curr.val.contains("E")&& curr.val.lastIndexOf("E")==curr.val.length()-1 && curr.next==null)

{

int i=curr.val.lastIndexOf("E");

String q=new String(curr.val);

curr.val=curr.val.substring(0, i);

StringNode rawr=new StringNode(curr,null,"E-A",false);

StringNode rawr2=new StringNode(rawr,curr.next,q.substring(i+1,q.length()),true);

rawr.next=rawr2;

curr.next=rawr;

}

while((curr.val.length()>0 && curr.val.substring(1).contains("U"))|| (curr!=s && curr.val.contains("U")))

{

int i;

if(curr==s)

i=curr.val.substring(1).indexOf("U")+1;

else

i=curr.val.indexOf("U");

String q=new String(curr.val);

curr.val=curr.val.substring(0, i);

StringNode rawr=new StringNode(curr,null,"OO",false);

StringNode rawr2=new StringNode(rawr,curr.next,q.substring(i+1,q.length()),true);

rawr.next=rawr2;

curr.next=rawr;

}

while(curr.val.contains("V"))

{

int i=curr.val.indexOf("V");

String q=new String(curr.val);

curr.val=curr.val.substring(0, i);

StringNode rawr=new StringNode(curr,null,"F",false);

StringNode rawr2=new StringNode(rawr,curr.next,q.substring(i+1,q.length()),true);

rawr.next=rawr2;

curr.next=rawr;

}

while(curr.val.contains("W"))

{

int i=curr.val.indexOf("W");

String q=new String(curr.val);

curr.val=curr.val.substring(0, i);

StringNode rawr=new StringNode(curr,null,"V",false);

StringNode rawr2=new StringNode(rawr,curr.next,q.substring(i+1),true);

rawr.next=rawr2;

curr.next=rawr;

}

curr=curr.next;

if(curr!=null)

curr=curr.next;

}

String ret="";

while(s!=null)

{

ret+=s.val;

s=s.next;

}

return ret;

}

}