#include<cstdio>
#include<vector>
#include<cstring>
#include<iostream>
#include<algorithm>
#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
struct node{
    int id,a;
    bool operator<(const node &W)const{
        return a<W.a;
    }
}a[1009];
int n; char s[1009][25];
void solve(){
    printf("Stage: ");
    scanf("%d",&n);
    bool f=0;
    for(int i=1;i<=n;i++) scanf("%s%d",s[i]+1,&a[i].a),a[i].id=i;
    for(int i=1;i<=n;i++){ int r=1;
        for(int j=1;j<=n;j++) r+=a[j].a>a[i].a;
        for(int j=1;j<=strlen(s[i]+1)-r;j++){
            if(!f) putchar(s[i][j]-'a'+'A'),f=1;
            else putchar(s[i][j]);
        }
    }
}
int main(){
    int T=1;
    // scanf("%d",&T);
    while(T--) solve();
    return 0;
}