#include<bits/stdc++.h>
#define pb push_back
#define x first
#define y second
#define endl '\n'
using namespace std;
using ll =long long ;
using pii =pair<int,int>;
using pll=pair<ll,ll>;
bool cmp(pll a,pll b){
	return a.y<b.y;
}
struct cmp1{
    bool operator()(pair<ll,ll>a,pair<ll,ll>b){
	if(a.x==b.x)return a.y>b.y;
	return a.x>b.x; 
}
};
const int mod=998244353;
ll ksm(ll a,ll b){ll ans=1;while(b){if(b&1){ans*=a;ans=ans%mod;}a=a*a;a%=mod;b>>=1;}return ans;}
ll gcd(ll a,ll b){ll t=a%b;while(t){a=b;b=t;t=a%b;}return b;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
ll get_inv(ll x){return ksm(x,mod-2);}
const int N=5e5+10;

void solve(){
	int n;
	cin>>n;
	vector<ll>cnt(n+1);
	vector<ll>v;
	vector<string>s(n+1);
	vector<ll>a(n+1);
	for(int i=1;i<=n;i++){
		cin>>s[i]>>a[i];
		v.pb(a[i]);
	}
	sort(v.begin(),v.end());
	string as="";
	for(int i=1;i<=n;i++){
		ll w=1+n-(upper_bound(v.begin(),v.end(),a[i])-v.begin());
		for(int j=0;j+w<s[i].size();j++){
			as+=s[i][j];
		}
	}
	as[0]-=32;
	cout<<"Stage:"<<as<<endl;
}
int main(){
	ios::sync_with_stdio(false);cin.tie(0);
	int _=1;
	// cin>>_;
	while(_--)solve();
	return 0;
}