AT_abc445_b [ABC445B] Center Alignment

You are given $ N $ strings $ S_1,S_2,\dots,S_N $ of odd lengths consisting of lowercase English letters. Let $ m $ be the length of the longest string among $ S_1,S_2,\dots,S_N $ . Find strings $ T_1,T_2,\dots,T_N $ satisfying the following condition. - Condition: $ T_i $ is a string of length $ m $ formed by concatenating $ k $ copies of `.`, $ S_i $ , and $ k $ copies of `.` in this order, for some non-negative integer $ k $ .

The input is given from Standard Input in the following format: > $ N $ $ S_1 $ $ S_2 $ $ \vdots $ $ S_N $

Output $ N $ lines. The $ i $ -th line $ (1 \leq i \leq N) $ should contain $ T_i $ .

### Sample Explanation 1 $ m=11 $ , and $ T_1,T_2,T_3,T_4 $ satisfy the condition in the problem statement for $ k=3,1,2,0 $ , respectively. ### Constraints - $ N $ is an integer between $ 1 $ and $ 100 $ , inclusive. - $ S_i $ is a string of odd length between $ 1 $ and $ 99 $ , inclusive, consisting of lowercase English letters.