Problem: Petya started to attend programming lessons. On the first lesson his task was to write a simple program. The program was supposed to do the following: in the given string, consisting if uppercase and lowercase Latin letters, it: 

  * deletes all the vowels, 
  * inserts a character "." before each consonant, 
  * replaces all uppercase consonants with corresponding lowercase ones. 



Vowels are letters "A", "O", "Y", "E", "U", "I", and the rest are consonants. The program's input is exactly one string, it should return the output as a single string, resulting after the program's processing the initial string.

Help Petya cope with this easy task.

Input

The first line represents input string of Petya's program. This string only consists of uppercase and lowercase Latin letters and its length is from 1 to 100, inclusive.

Output

Print the resulting string. It is guaranteed that this string is not empty.

Examples

Input

tour


Output

.t.r


Input

Codeforces


Output

.c.d.f.r.c.s


Input

aBAcAba


Output

.b.c.b

Solution (in PYTHON3):

Solution:
# May the Speedforce be with us...
'''
for _ in range(int(input())):
arr=list(map(int,input().split()))
n,k=map(int,input().split())
n=int(input())
s=input()

from collections import defaultdict
d=defaultdict()

d=dict()
s=set()
s.intersection()
s.union()
s.difference()


problem statement achhe se padhna hai
age se bhi dekhna hai, piche se bhi dekhna hai
'''
#from math import gcd,ceil,sin,radians,cos
#from bisect import insort
from collections import defaultdict as dd
def lcm(a,b):
	return (a*b)//gcd(a,b)
def inin():
	return int(input())
def inar():
	return list(map(int,input().split()))
def ar(element,size):
	return [element for i in range(size)]
def digitsum(num): #return the sum of dogots of a number
	su=0
	while(num):
		su+=num%10
		num//=10
	return su
def yes():
	print('YES')
def no():
	print('NO')

def countDivisibles(A, B, M): #count numbers in the range[A,B] which are divisible by M
    if (A % M == 0): 
        return ((B // M) - (A // M)) + 1
    return ((B // M) - (A // M)) 
	
def  countSetBits(n): #count the number of set bits in the binary representation of an integer
    count = 0
    while (n): 
        count += n & 1
        n >>= 1
    return count




Testcase=1
for _ in range(Testcase):
	s=input()
	ans=''
	for i in s:
		if i in 'aeiouyAEIOUY':
			continue
		else:
			ans+='.'+i.lower()
	print(ans)