#include<bits/stdc++.h>
using namespace std;
#define rg register
#define maxn 215
#define ll long long
#define IT set<node>::iterator
#define int ll
#pragma GCC optimize(3)
#pragma -fcrossjumping
#pragma -fdefer-pop
#pragma -fmerge-constans
#pragma -fthread-jumps
#pragma -floop-optimize
#pragma -fif-conversion
#pragma -fif-conversion2
#pragma -fdelayed-branch
#pragma -fguess-branch-probability
#pragma -fcprop-registers
#pragma -fforce-mem
#pragma -foptimize-sibling-calls
#pragma -fstrength-reduce
#pragma -fgcse
#pragma -fcse-follow-jumps
#pragma -frerun-cse-after-loop
#pragma -fdelete-null-pointer-checks
#pragma -fextensive-optimizations
#pragma -fregmove
#pragma -fschedule-insns
#pragma -fsched-interblock
#pragma -fcaller-saves
#pragma -fpeephole2
#pragma -freorder-blocks
#pragma -fstrict-aliasing
#pragma -funit-at-a-time
#pragma -falign-functions
#pragma -fcrossjumping
#pragma -finline-functions
#pragma -fweb
#pragma -fgcse-after-reload
inline int read()
{
    int x=0,f=1;
    char c=getchar();
    while(c<'0'||c>'9')
    {
        if(c=='-') f=-1;
        c=getchar();
    }
    while(c<='9'&&c>='0')
    {
        x=(x<<1)+(x<<3)+(c^48);
        c=getchar();
    }
    return x*f;
}
inline int max(int a,int b)
{
	if(a>b) return a;
	return b;
}
int n;
string s[maxn];
int ans[maxn][maxn],maxx;
int blk[maxn],num[maxn][maxn];
string c[maxn][maxn];
inline void pre_work()
{
	for(rg int i=1;i<=n;++i)
	{
		ans[i][1]=0;
		int tot=0,cnt=0,st=0;
		for(rg int j=0;j<s[i].length();++j) 
		{
			if(s[i][j]==' ')
			{
				tot++;
				num[i][tot]=cnt;
				c[i][tot]=s[i].substr(st,cnt);
				cnt=0;
				st=j+1;
			}
			else cnt++;
		}
		blk[i]=tot+1;
		maxx=max(maxx,blk[i]);
		num[i][blk[i]]=cnt;
		c[i][tot+1]=s[i].substr(st,cnt);
	}
}
int now_word=1,st;
signed main()
{
	n=read();
	for(rg int i=1;i<=n;++i) getline(cin,s[i]);
	pre_work();
	while(now_word<=maxx)
	{
		int maxnum=0;
		for(rg int i=1;i<=n;++i)
		{
			if(blk[i]<now_word) continue;
			maxnum=max(maxnum,num[i][now_word]);
		}
		now_word++;
		for(rg int i=1;i<=n;++i) ans[i][now_word]=st+(maxnum+1);
		st+=(maxnum+1);
	}
	for(rg int i=1;i<=n;++i)
	{
		int temp=0;
	//	cout<<"i="<<i<<" blk="<<blk[i]<<endl;
		for(rg int j=1;j<=blk[i];++j) 
		{
		//	cout<<ans[i][j]<<" "<<num[i][j]<<endl;
			
			cout<<c[i][j];
			temp+=num[i][j];
			while(temp<ans[i][j+1]) 
			{
				cout<<" ";
				++temp;
			}
		}
		cout<<endl;
	//	system("Pause");
	}
}