#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<string.h>
#include<assert.h>
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

/* size denotes the number of books in the pile */
/* Under the k-th book in the pile (inclusive), the up[k]-th book has minimum amount of unsolved problems */
char name[1000000][16];
int remain[1000000], up[1000000];

int main(){
  int N;
  
  int i, j, k, len, size;

  assert( scanf("%d",&N)==1 );
  assert( 1<=N && N<=1000000 );

  size = 0;
  while(N--){
    assert( scanf("%d",&k)==1 );
    if(k==-1){
      assert( size > 0 );
      printf("%d %s\n",size-1 - up[size-1], name[up[size-1]]);
      size = up[size-1];
    } else {
      assert(scanf("%s",name[size])==1);
      len = strlen(name[size]);
      assert( 1<=len && len<=15 );
      rep(i,len) assert( 'a'<=name[size][i]&&name[size][i]<='z' );
      remain[size] = k;

      if(k==0) continue;
      
      if(remain[size] <= remain[up[size-1]]) up[size] = size;
      else                                   up[size] = up[size-1];
      size++;
    }
  }

  return 0;
}