public void insertarIesimo(int x, int i){

int k=this.cantElem-1;
while(k>=i){
this.Elem[k+1]=this.Elem[k];
k=k-1;
}
this.Elem[i]=x;
this.cantElem=this.cantElem+1;
}

public void insertarLugarAsc(int x)

{
int i=0;
while(this.Elem[i]<=x)
{
i++;
}
insertarIesimo(x, i);
}

public void insertarLugarDes(int x)

{
int i=0;
while(this.Elem[i]>=x)
{
i++;
}
insertarIesimo(x, i);
}

public void eliminarIesimo(int i){

int k=i+1;
while(k<this.cantElem){
this.Elem[k-1]=this.Elem[k];
k=k+1;
}
this.cantElem=this.cantElem-1;
}

public void eliminarTodo(int x){

int i=0;
while(i<this.cantElem){
if(this.Elem[i]==x) this.eliminarIesimo(i);
else i=i+1;
}
}

public void eliminarPrim()

{
this.eliminarIesimo(0);
}

public void eliminarInicio(int n)

{
int c=1;
while(c <= n){
this.eliminarPrim();
 c = c+1;
}
}

public void eliminarUlt()

{
this.eliminarIesimo(this.cantElem-1);
}

public void eliminarFinal(int n)

{
int i=1;
while(i <= n){
this.eliminarUlt();
i = i+1;
}
}

public void eliminarDup()

{
int i=0;
while(i<this.cantElem)
{
int j=i+1;
while(j<this.cantElem)
{
if(this.Elem[i]==this.Elem[j])
{
eliminarIesimo(i);
}
else
{
if(frecuencia(this.Elem[i])>1)eliminarIesimo(i);
}
j++;
}
i++;
}
}

public void eliminarUnicos()

{
int i=0;
while(i<this.cantElem)
{
if(frecuencia(this.Elem[i])==1)eliminarIesimo(i);
i++;
}
}

public void eliminarTodo(Lista1 L2)

{
int i=0;
while(i<L2.cantElem||i<this.cantElem)
{
int j=0;
while(j<this.cantElem)
 {
if(L2.seEncuentra(this.Elem[j]))eliminarTodo(this.Elem[j]);
j++;
}
i++;
}
}

public void eliminarExtremo(int n)

{
int i=1;
while(i<=n)
{
this.eliminarPrim();
this.eliminarUlt();
i=i+1;
}
}

public void eliminar(int i, int n)

{
int j=1;
while(j<=n)
{
this.eliminarIesimo(i);
j=j+1;
}
}

public void eliminarPares()

{
int i=0;
while(i < this.cantElem)
{
if(this.Elem[i]%2==0)
{
eliminarTodo(this.Elem[i]);i--;
}
i++;
}
}

public void rotarIzqDer(int n)

{
int i = 1;
while(i <= n){
int x = this.Elem[this.cantElem-1];
this.eliminarUlt();
this.insertarPrim(x);
i++;
}
}

public void rotarDerIzq(int n)

{
int i = 1;
while(i <= n)
{
 int x = this.Elem[0];
this.eliminarPrim();
this.insertarUlt(x);
i++;
}
}