public class probata {

   public static SLL<Integer> funkcija(SLL<Integer> list, int n){

       SLLNode<Integer>node=list.getFirst();
       int counter=0;
       SLL<Integer>pomosna=new SLL<Integer>();
       while(node!=null)
       {
           while(counter<n)
           {
               pomosna.insertLast(node.element);
               list.delete(node);
               node=node.succ;
               counter++;
           }
           //counter++;
           node=node.succ;
       }
       SLLNode<Integer>m=list.getFirst();
       SLLNode<Integer>novNode=pomosna.getFirst();
       while(novNode!=null)
       {
           list.insertLast(novNode.element);
           novNode=novNode.succ;
       }
        return list;
    }

    public static void main (String args[]) {
        Scanner sc=new Scanner(System.in);
        SLL<Integer>lista=new SLL<Integer>();
        int n=sc.nextInt();
        for(int i=0;i<n;i++)
        {
            int m=sc.nextInt();
            lista.insertLast(m);
        }
        int vnesi=sc.nextInt();
        System.out.println(funkcija(lista,vnesi));
    }

}