#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define ll long long
using namespace std;
const int N=55;
string s;
bool b1[N],b2[N];
int n,m,m1,m2;
bool f(char c){return(c>='A'&&c<='Z')||(c>='a'&&c<='z');}
bool g(char c){return c=='a'||c=='e'||c=='i'||c=='o'||c=='u'||c=='A'||c=='E'||c=='I'||c=='O'||c=='U';}
void pr(bool *b){for(int i=0;i<n;i++)putchar(b[i]||!f(s[i])?s[i]:'.');putchar('\n');}
void replc1(int m,bool *b){for(int i=0,j=0;j<m;i++)if(f(s[i]))b[i]=1,j++;}
void replc2(int m,bool *b){for(int i=m;i<n;i++)if(g(s[i]))b[i]=1;}
bool fd(int m){for(int i=m;i<n;i++)if(g(s[i]))return 1;return 0;}
int main(){
getline(cin,s);
n=s.size();pr(b1);
for(int i=0;i<n;i++)if(f(s[i]))m++;
m1=m/3.0+0.5;m2=m*2.0/3.0+0.5;
replc1(m1,b1);pr(b1);
if(fd(m1))replc2(m1,b1),pr(b1);
else replc1(m2,b2),pr(b2);
return 0;
}