#include <bits/stdc++.h>
#define itn int
#define ll long long
#define retrun return
#define ull unsigned long long
//#pragma GCC optimize(1)
//#pragma GCC optimize(2)
//#pragma GCC optimize(3)
//#pragma GCC optimize(3,"Ofast","inline")
//#include <algorithm>
using namespace std;

int in(){
	char c=getchar();
	int x=0,f=1;
	for(;c<'0' || c>'9';c=getchar())
		if(c=='-') f=-1;
	for(;c>='0' && c<='9';c=getchar())
		x=(x<<1)+(x<<3)+(c^48);
	return x*f;
}

struct KILL{
	string a,b;
}a1[105]; 

int main(void){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	int n=in();
	string aa="section",bb="subsection",cc="subsubsection"; 
	for(int i=0;i<n;i++)
		cin>>a1[i].a>>a1[i].b;
	int xx=0,yy=0,zz=0;
	for(int i=0;i<n;i++){
		if(a1[i].a==aa){ 
			xx++;
			cout<<xx<<" "<<a1[i].b<<endl;
		}
		if(a1[i].a==bb){ 
			yy++; 
			cout<<xx<<'.'<<yy<<" "<<a1[i].b<<endl;
		}
		if(a1[i].a==cc){ 
			zz++;
			cout<<xx<<'.'<<yy<<'.'<<zz<<" "<<a1[i].b<<endl;
		}
	}
	return (0);
}