#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define Foxyy cin.tie(0); cout.sync_with_stdio(0); cout.tie(0);
struct Solver {
int& n;
void solve() {
array<int, 3> cnt{};
for (int i = 0; i < n; i++) {
string command;
string title;
cin >> command >> title;
if (command == "section") {
cnt[0]++;
cnt[1] = cnt[2] = 0;
cout << cnt[0] << ' ' << title << '\n';
} else if (command == "subsection") {
cnt[1]++;
cnt[2] = 0;
cout << cnt[0] << '.' << cnt[1] << ' ' << title << '\n';
} else if (command == "subsubsection") {
cnt[2]++;
cout << cnt[0] << '.' << cnt[1] << '.' << cnt[2] << ' ' << title << '\n';
}
}
}
};
signed main() {
Foxyy
int T = 1;
// cin >> T;
while(T--) {
int n;
cin >> n;
Solver solver{n};
solver.solve();
}
}
