[APS] Split Vowels & Consonants

//podeli gi taka sto ke ja izminuvas originalnata lista element od napred pa od nazad do sredina.
import java.util.Scanner;
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;
                if(tmp.succ==null){
                    ret+=tmp;
                    break;
                }
                ret += tmp + "<->";
            }
        } else
            ret = "Prazna lista!!!";
        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 void izvadiDupliIPrebroj(){

    }
}
public class SplitLetters {
    public static void sum_and_append(DLL<Character> list,DLL<Character> list_sam, DLL<Character> list_sog) {
        DLLNode<Character> front = list.getFirst();
        DLLNode<Character> rear = list.getLast();
        while (true) {
            if (front.element == 'a' || front.element == 'u' || front.element == 'e' || front.element == 'o' || front.element == 'i') {
                list_sam.insertLast(front.element);
            } else {
                list_sog.insertLast(front.element);
            }
            if(front==rear) break;
            front = front.succ;
            if (rear.element == 'a' || rear.element == 'u' || rear.element == 'e' || rear.element == 'o' || rear.element == 'i') {
                list_sam.insertLast(rear.element);
            } else {
                list_sog.insertLast(rear.element);
            }
            rear = rear.pred;
            if(rear.succ==front) break;
        }
    }
    public static void main(String[] args) {
        Scanner input= new Scanner(System.in);
        int n= Integer.parseInt(input.nextLine());
        String bukvi= input.nextLine();
        DLL<Character> lista= new DLL<>();
        DLL<Character> lista_sam= new DLL<>();
        DLL<Character> lista_sog= new DLL<>();
        for(int i=0;i<2*n;i+=2){
            lista.insertLast((bukvi.charAt(i)));
        }
        sum_and_append(lista,lista_sam,lista_sog);
        System.out.println(lista_sam);
        System.out.println(lista_sog);
    }
}
/*
10
a b c d e f g h i j
a<->i<->e
j<->b<->c<->h<->d<->g<->f

11
s u d i j a p e d e r
u<->e<->i<->e<->a
s<->r<->d<->d<->j<->p
 */