#include <bits/stdc++.h>
using namespace std;
long long spf[2];
long long fac[2];
void sieve() {
  spf[1] = 1;
  for (long long i = 2; i < 2; i++) spf[i] = i;
  for (long long i = 4; i < 2; i += 2) spf[i] = 2;
  for (long long i = 3; i * i < 2; i++) {
    if (spf[i] == i) {
      for (long long j = i * i; j < 2; j += i)
        if (spf[j] == j) spf[j] = i;
    }
  }
}
map<long long, long long> getfactor(long long a) {
  map<long long, long long> m;
  while (a > 1) {
    m[spf[a]]++;
    a /= spf[a];
  }
  return m;
}
long long power(long long x, long long y, long long p) {
  long long res = 1;
  x = x;
  if (x == 0) return 0;
  while (y > 0) {
    if (y & 1) res = (res * x);
    y = y >> 1;
    x = (x * x);
  }
  return res;
}
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long inverse(long long a, long long p) { return power(a, p - 2, p); }
long long ncr(long long n, long long r, long long p) {
  if (r == 0) return 1;
  return (fac[n] * inverse(fac[r], p) % p * inverse(fac[n - r], p) % p) % p;
}
void solve() {
  long long n;
  cin >> n;
  pair<long long, string> p[n + 1];
  for (long long i = 1; i <= n; i++) cin >> p[i].second >> p[i].first;
  sort(p + 1, p + n + 1);
  multiset<long long, greater<long long> > s;
  long long ans[n + 1];
  long long cur = 1;
  long long flag = 0;
  for (long long i = 1; i <= n; i++) {
    if (p[i].first >= i) flag++;
    if (p[i].first == 0)
      ans[i] = cur;
    else {
      long long count = 0;
      long long temp = 0;
      for (auto it : s) {
        count++;
        if (count == p[i].first) {
          temp = it;
          break;
        }
      }
      ans[i] = temp;
      for (long long j = i - 1; j >= 1; j--)
        if (ans[j] >= temp) ans[j]++;
    }
    s.insert(cur);
    cur++;
  }
  if (flag) {
    cout << -1 << '\n';
    return;
  }
  for (long long i = 1; i <= n; i++)
    cout << p[i].second << " " << ans[i] << '\n';
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t = 1;
  while (t--) {
    solve();
  }
}
