#include <bits/stdc++.h>

using i64 = long long;

struct Node {
    std::string name;
    int v, rk, id;
};

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int n;
    std::cin >> n;
    std::vector<Node> a(n);
    for (int i = 0; i < n; i++) {
        std::cin >> a[i].name >> a[i].v;
        a[i].id = i;
    }

    std::sort(a.begin(), a.end(),
        [](Node n1, Node n2) {
            return n1.v > n2.v;
        });

    int rk = 1;
    for (int l = 0, r = 0; r < n; l = r) {
        while (r < n && a[l].v == a[r].v) {
            a[r].rk = rk;
            r++;
        }
        rk++;
    }
    for (int i = 0; i < n; i++) {
        if (a[i].name.length() < a[i].rk) {
            a[i].name = "";
            continue;
        }
        for (int j = 0; j < a[i].rk; j++) {
            a[i].name.pop_back();
        }
    }
    std::sort(a.begin(), a.end(),
        [](Node n1, Node n2) {
            return n1.id < n2.id;
        });
    std::string ans;
    for (int i = 0; i < n; i++) {
        ans += a[i].name;
    }
    if (ans.length() > 0) {
        ans[0] = std::toupper(ans[0]);
    }

    std::cout << "Stage: " << ans << '\n';

    return 0;
}