#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <unordered_map>
#include <map>
#include <string>
#include <cmath>
#include <deque>
#include <cstring>
#include <set>

using namespace std;

#define endl '\n'

struct troi {
    int first, second, dist;
    troi(int a, int b, int c) : first(a), second(b), dist(c) {}
};

bool operator<(const troi a, const troi other) {
        return a.dist < other.dist || (a.dist == other.dist && a.first > other.first)
            || (a.dist == other.dist && a.first == other.first && a.second < other.second);
}

//bool cmp(pair<int, string> a, pair<int, string> b) {
//  return a.first > b.first || (a.first == b.first && a.second > b.second);
//}

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

    int n;
    cin >> n;

    vector<string> name(n);
    vector<int> ver(n);
    vector<vector<pair<int, string> > > edges(n);
    string s;
    int v;
    map<pair<string, int>, int> num;
    for (int i = 0; i < n; i++) {
        cin >> name[i] >> ver[i];
        int m;
        cin >> m;
        for (int j = 0; j < m; j++) {
            cin >> s >> v;
            edges[i].push_back(make_pair(v, s));
        }
        //sort(edges[i].begin(), edges[i].end(), cmp);
        num[make_pair(name[i], ver[i])] = i;
    }

    map<string, bool> used;
    set<troi> q;
    q.insert(troi(ver[0], 0, 0));
    vector<pair<string, int> > ans;
    while (!q.empty()) {
        auto u = *(q.begin());
        if (used.find(name[u.second]) != used.end()) {
            q.erase(u);
            continue;
        }
        used[name[u.second]] = true;
        for (auto v : edges[u.second]) {
            auto ind = num[make_pair(v.second, v.first)];
            q.insert(troi(ver[ind], ind, u.dist + 1));
        }
        if (u.second != 0) {
            ans.push_back(make_pair(name[u.second], u.first));
        }
        q.erase(u);
    }

    cout << ans.size() << endl;
    sort(ans.begin(), ans.end());
    for (auto i : ans) {
        cout << i.first << " " << i.second << endl;
    }
}