#include<stdio.h>
#include<stdlib.h>
typedef struct node
{
    int data;
    struct node *next;
}Node;
Node *head=NULL,*tail=NULL;

void create(int n)
{
    Node *newNode=(Node*)malloc(sizeof(Node));
    newNode->data=n;
    newNode->next=NULL;
    if(head==NULL)
    {
        head=newNode;
        tail=newNode;
    }
    else
    {
        tail->next=newNode;
        tail=newNode;
    }
}
void insertion(int val,int pos,int size)
{
    Node *newNode = (Node*)malloc (1*sizeof(Node));
    newNode->data=val;
    newNode->next=NULL;
    node*temp=head;
    for(int i=0;i<ind-2;i++)
    {
        temp=temp->next;
    }
    newNode->next=temp->next;
    temp->next=newNode;
}
void print()
{
    Node *temp=head;
    while(temp!=0)
    {
        printf("%d",&n);
        temp=temp->next;
    }
}
int main()
{
    int n,data,pos,val;
    scanf("%d",&n);
    for(int i=0;i<n;i++)
    {
        scanf("%d",&val);
        scanf("%d",&pos);
        if(pos<0)
        {
            printf("Invalid inout");
            return 0;
        }
        insert(val,pos);
        print();
}