#include<bits/stdc++.h>
using namespace std;
#define in read()
//#define int long long
#define mp make_pair
#define pii pair<int,int>
#define fi first
#define se second
#define lowbit(x) (x&-x)
#define pi acos(-1)
inline int read(){
	int f=1,k=0;
	char cp=getchar();
	while(cp!='-'&&(cp<'0'||cp>'9')) cp=getchar();
	if(cp=='-') f=-1,cp=getchar();
	while(cp>='0'&&cp<='9') k=(k<<3)+(k<<1)+cp-48,cp=getchar();
	return f*k;
}
const int N = 1e4+10;
struct Edge{
	int u,v,w,nxt;
}e[N<<1];
int n,first[N],dis[N],ccc,m,vis[N],T;
//void add(int u, int v, int w=1) {e[++ccc]=(Edge){u,v,w,first[u]};first[u]=ccc;}
int gcd(int a,int b) {
    return b>0 ? gcd(b,a%b):a;
}
char s[N][101];
int a[N],r[N],ss[N];
int main() {
	ios::sync_with_stdio(false);cin.tie(0);
	cin>>n;
	for(int i = 1; i <= n; i++) {
		cin>>s[i]>>a[i];r[i]=1;
		ss[i]=strlen(s[i]);
	} 
	for(int i  = 1; i <= n; i++) {
		for(int j = 1;j<=n;j++) {
			if(j==i) continue;
			if(a[j]>a[i]) r[i]++;
		}
	}
//	for(int i = 1; i <= n; i++) {
//		cout<<ss[i]<<"\n";
//	} 
	cout<<"Stage:";
	int fl=0;
	
	for(int i = 1; i <= n; i++) {
		if(ss[i]-r[i]<=0) continue;
		for(int j = 0; j < ss[i]-r[i]; j++) {
			if(fl==0) {
//				cout<<"??"<<i<<"\n";
				fl=1; cout<<char(s[i][j]-'a'+'A');continue;
			}
			cout<<s[i][j];
		}
	}
	return 0;
}
//-Wall -Wextra -std=c++11