int longestPalindromeSubseq(string s) {
int n=s.size();
int arr[n][n];
for (int i=0;i<n;i++) {
for (int j=0; j<n;j++) {
if (i==j ) {
arr[i][j] = 1;
} else {
arr[i][j] = 0;
}
}
}
for (int cl=2; cl<=n;cl++) {
for (int i=0;i<n-cl+1;i++) {
int j=i+cl-1;
if (s[i] == s[j] && cl==2 ) {
arr[i][j] = 2;
}
else if (s[i] == s[j] ) {
arr[i][j] = arr[i+1][j-1] +2;
}
else if (s[i] != s[j] ) {
arr[i][j] = max(arr[i][j-1], arr[i+1][j]);
}
}
}
return arr[0][n-1];
}
n=int(input())
for i in range(n):
s=input().split('.')
s=s[::-1]
l=[]
k=""
for item in s:
k=k+item+"."
print (k[:-1])