using System;

public class Program

{

    public static void Main()

    {

        //Console.WriteLine("Hello World");

        Solve();

    }   

    public class ListNode {

         public int val;

         public ListNode next;

         public ListNode(int x) {this.val = x; this.next = null;}

    }

    public static ListNode head; 

​

    public static void Solve(){

        int t = Convert.ToInt32(Console.ReadLine());

​

        for(int i =0; i<t;i++){

            String[] A = Console.ReadLine().Split(' ');

            if(A[0]=="i"){

                insert_node(Convert.ToInt32(A[1]),Convert.ToInt32(A[2]));

            }

            else if(A[0]=="p"){

                print_ll();

            }

            else if (A[0]=="d"){

                delete_node(Convert.ToInt32(A[1]));

            }

            else{

                continue;

            }

        }

    }

​

    public  static void insert_node(int position, int value) {

        // @params position, integer

        // @params value, integer

        ListNode newNode = new ListNode(value);

        if(head == null && position ==1 ){

            head = new ListNode(value);

            return;

        }

        if(head!=null && position==1){

            newNode.next = head;

            head = newNode;

            return;

        }

        int i =1;

        ListNode IndexNode = head, prev=null;

        while(IndexNode!=null && i<position){

            prev=IndexNode;

            IndexNode = IndexNode.next;

            i++;

        }

        if(position==i){

            newNode.next=IndexNode;

            prev.next=newNode;

        }

    }

    public static void delete_node(int position) {

        // @params position, integer

        ListNode TargetNode= head, prev = null;

            //list is not empty and index 0 needs to be deleted

            if(TargetNode!=null && position==1){

                head = TargetNode.next;

                //TargetNode.next=null;

                return;

            }

            int i =1;

            while(TargetNode!=null && i<position){

                prev = TargetNode;

                TargetNode = TargetNode.next;

                i++;

            }

            // if invalid index greater than length of list, just return

            if(TargetNode ==null){

                return;

            }

            prev.next = TargetNode.next;

    }

​

    public  static void print_ll() {

        // Output each element followed by a space

        ListNode st = head;

        while(st !=null){

            Console.Write(st.val);

            if(st.next!=null){

                        Console.Write(" ");

            }                

            st = st.next;

        }

        Console.Write(Environment.NewLine);

    }

}

​