//  _                          _   _
// | |   ___    _ __     ___  | | (_)  _ __     ___   ___   ___
// | |  / _ \  | '_ \   / _ \ | | | | | '_ \   / _ \ / __| / __|
// | | | (_) | | | | | |  __/ | | | | | | | | |  __/ \__ \ \__ \
// |_|  \___/  |_| |_|  \___| |_| |_| |_| |_|  \___| |___/ |___/
//
#include<iostream>
#include<algorithm>
#include<cstring>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<cmath>
#include<unordered_map>
using namespace std;
#define int long long
#define endl "\n"
const int N=1e5+10;
typedef pair<int,int> PII;
int n,m,k;
void solve()
{
    cin>>n;
    vector<pair<int,string>>s;
    for(int i= 0;i < n;i ++){
        int a;
        string s1;
        cin>>s1>>a;
        s.emplace_back(a,s1);
    }
    auto tem = s;
    sort(s.begin(),s.end());
    reverse(s.begin(),s.end());
    map<string,int>mp;
    for(int i= 0;i < n;i ++){
        if(i&&s[i].first==s[i-1].first)mp[s[i].second]=mp[s[i-1].second];
        else mp[s[i].second]=i+1;
    }
    string ans;
    for(int i = 0;i < n;i ++){
        int cnt = mp[tem[i].second];
//        cout<<cnt<<endl;
        if(cnt>=tem[i].second.size())continue;
        else ans+=tem[i].second.substr(0,tem[i].second.size()-cnt);
//        cout<<ans<<endl;
    }
    cout<<"Stage: ";
    if(!ans.empty())ans[0]= ans[0]-32;
    cout<<ans<<endl;



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