#pragma GCC optimize("unroll-loops,Ofast,O3")
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define spc << " " <<
#define endl "\n"
#define all(x) x.begin(), x.end()
#define ll long long
#define int long long
#define ii pair<int,int>
#define vi vector<int>
#define vii vector<ii>
#define st first
#define nd second
#define inf 1000000009
#define MOD 998244353
using namespace std;
void solve(){
int n; cin >> n;
int arr[3];
arr[0]=arr[1]=arr[2]=0;
for(int i=1; i<=n; i++){
string s, t; cin >> s >> t;
if(s=="section"){
arr[1]=arr[2]=0;
arr[0]++;
}
else if(s=="subsection"){
arr[2]=0;
arr[1]++;
}
else if(s=="subsubsection"){
arr[2]++;
}
cout << arr[0];
if(arr[1]>0) cout << "." << arr[1];
if(arr[2]>0) cout << "." << arr[2];
cout << " " << t << endl;
}
}
signed main(){
ios_base::sync_with_stdio(false);cin.tie(0);
#ifdef Local
freopen("in","r",stdin);
freopen("out","w",stdout);
#endif
ll t=1;
//cin >> t;
while(t--) solve();
}
