DelumnoResenaSoglaski

package brisiDuplikat;


import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.IOException;

class DLLNode<E> {
protected E element;
protected DLLNode<E> pred, succ;

public DLLNode(E elem, DLLNode<E> pred, DLLNode<E> succ) {
this.element = elem;
this.pred = pred;
this.succ = succ;
}

@Override
public String toString() {
return element.toString();
}
}

class DLL<E> {
private DLLNode<E> first, last;

public DLL() {
// Construct an empty SLL
this.first = null;
this.last = null;
}

public void deleteList() {
first = null;
last = null;
}
public int length() {
int ret;
if (first != null) {
DLLNode<E> tmp = first;
ret = 1;
while (tmp.succ != null) {
tmp = tmp.succ;
ret++;
}
return ret;
} else
return 0;

}

public DLLNode<E> find(E o) {
if (first != null) {
DLLNode<E> tmp = first;
while (tmp.element != o && tmp.succ != null)
tmp = tmp.succ;
if (tmp.element == o) {
return tmp;
} else {
System.out.println("Elementot ne postoi vo listata");
}
} else {
System.out.println("Listata e prazna");
}
return first;
}
public void insertFirst(E o) {
DLLNode<E> ins = new DLLNode<E>(o, null, first);
if (first == null)
last = ins;
else
first.pred = ins;
first = ins;
}

public void insertLast(E o) {
if (first == null)
insertFirst(o);
else {
DLLNode<E> ins = new DLLNode<E>(o, last, null);
last.succ = ins;
last = ins;
}
}

public void insertAfter(E o, DLLNode<E> after) {
if(after==last){
insertLast(o);
return;
}
DLLNode<E> ins = new DLLNode<E>(o, after, after.succ);
after.succ.pred = ins;
after.succ = ins;
}

public void insertBefore(E o, DLLNode<E> before) {
if(before == first){
insertFirst(o);
return;
}
DLLNode<E> ins = new DLLNode<E>(o, before.pred, before);
before.pred.succ = ins;
before.pred = ins;
}

public E deleteFirst() {
if (first != null) {
DLLNode<E> tmp = first;
first = first.succ;
if (first != null) first.pred = null;
if (first == null)
last = null;
return tmp.element;
} else
return null;
}

public E deleteLast() {
if (first != null) {
if (first.succ == null)
return deleteFirst();
else {
DLLNode<E> tmp = last;
last = last.pred;
last.succ = null;
return tmp.element;
}
}
// else throw Exception
return null;
}

public E delete(DLLNode<E> node) {
if(node==first){
deleteFirst();
return node.element;
}
if(node==last){
deleteLast();
return node.element;
}
node.pred.succ = node.succ;
node.succ.pred = node.pred;
return node.element;
}

@Override
public String toString() {
String ret = new String();
if (first != null) {
DLLNode<E> tmp = first;
ret += tmp + " ";
while (tmp.succ != null) {
tmp = tmp.succ;
ret += tmp + " ";
}
}
return ret;
}
public String toStringR() {
String ret = new String();
if (last != null) {
DLLNode<E> tmp = last;
ret += tmp + "<->";
while (tmp.pred != null) {
tmp = tmp.pred;
ret += tmp + "<->";
}
} else
ret = "Prazna lista!!!";
return ret;
}

public DLLNode<E> getFirst() {
return first;
}

public DLLNode<E> getLast() {

return last;
}
}



public class BrisiDuplikati {

    public static void brisiDuplikatiSamoglaski(DLL<Character> lista) {

        DLLNode<Character> dvizi=lista.getFirst();


        while(dvizi.succ!=null) {
            if(dvizi.succ.succ==null) {
                if(dvizi.element==dvizi.succ.element) {
                    dvizi.succ=null;
                    break;
                }
            }
            if((dvizi.element==dvizi.succ.element)) {
                if(dvizi.succ.succ!=null) {
                dvizi.succ=dvizi.succ.succ;
                dvizi.succ.succ.pred=dvizi;
                }
            }
            else {
                dvizi=dvizi.succ;
            }
        }
        System.out.println(lista);
        DLLNode<Character> dvizi1=lista.getFirst();

        while(dvizi1.succ!=null)
        {
            if(dvizi1.element=='a' || dvizi1.element=='e' || dvizi1.element=='i' ||dvizi1.element=='o' || dvizi1.element=='u') {
                if(dvizi1.succ.element=='a' || dvizi1.succ.element=='e' || dvizi1.succ.element=='i' ||dvizi1.succ.element=='o' || dvizi1.succ.element=='u') {

                    dvizi1.succ=dvizi1.succ.succ;
                    dvizi1.succ.succ.pred=dvizi1;
                }
                else {
                    dvizi1=dvizi1.succ;
                }
            }
            else {
                if(dvizi1.succ.element=='a' || dvizi1.succ.element=='e' || dvizi1.succ.element=='i' ||dvizi1.succ.element=='o' || dvizi1.succ.element=='u') {
                    dvizi1=dvizi1.succ;
                }
                else {
                    dvizi1.succ=dvizi1.succ.succ;
                    dvizi1.succ.succ.pred=dvizi1;
                }
            }
        }




        System.out.print(lista);

    }

    public static void main(String[] args) throws IOException {
        // TODO Auto-generated method stub
        DLL<Character> lista=new DLL<>();
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        String line=br.readLine();
        String[] pomniza=line.split(" ");
        for(int i=0;i<pomniza.length;i++) {

            lista.insertLast(pomniza[i].charAt(0));

        }

        brisiDuplikatiSamoglaski(lista);




    }

}