#include<stdio.h>
#include<stdlib.h>
typedef struct node{
    int id;
    int ar;
    struct node *next;
}Node;
Node *front=NULL,*rear=NULL;
void enqueue(int v,int t){
    Node *newnode=(Node*)malloc(sizeof(Node));
    newnode->id=v;
    newnode->ar=t;
    newnode->next=NULL;
    if(front==NULL){
        front=rear=newnode;
    }
    else{
        rear->next=newnode;
        rear=newnode;
    }
}
void dequeue(){
    if(front==NULL){
        printf("queue is empty");
        return;
    }
    while(front!=NULL){
        printf("%d\n",front-<id);
        front=front->next;
    }
}
int main(){
    int n,x,y;
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        scanf("%d %d",&x,&y);
        enqueue(x,y);
    }
    dequeue();
    return 0;
}