#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
using ll = long long;

void solve() {
    int n; cin >> n;
    vector<pair<string, int>> a(n + 1);
    for (int i = 1; i <= n; ++i)
        cin >> a[i].first >> a[i].second;
    vector<int> idx(n + 1),rnk(n + 1);
    iota(idx.begin(), idx.end(), 0);
    stable_sort(idx.begin() + 1, idx.end(), [&](int l, int r) -> bool {return a[l].second > a[r].second; });
    // for (int i = 1; i <= n; ++i) mp[i] = idx[i];

    for (int i = 1; i <= n; ++i) {
        rnk[i] = i;
        int p = idx[i];
        int len = a[p].first.length();
        if (i > 1)
        {
            if (a[p].second == a[p - 1].second) rnk[i] = rnk[i - 1];
        }
        if (rnk[i] >= len) a[p].first = {};
        else a[p].first = a[p].first.substr(0, len - rnk[i]);
    }
    // sort(a.begin() + 1,a.end(),[&](const auto& l,const auto& r))
    cout << "Stage: ";
    string ans = {};
    for (int i = 1; i <= n; ++i) {
        ans += a[i].first;
    }
    ans[0] -= 32;
    cout << ans;
    // cout << a[idx[mp[1]]].first[0] << a[idx[mp[1]]].first.substr(1, idx[]);
    // for (int i = 2; i <= n; ++i) {
    //     cout << a[idx[mp[i]]].first;
    // }
    
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(0);
    int t = 1; //cin >> t;
    while (t--)
        solve();
    return 0;
}