Подели по парност

import java.util.Scanner;

public class PodeliParnost {
    public static void podeli(DLL<Integer> list){
        DLL<Integer> evenList=new DLL<>();
        DLL<Integer> oddList=new DLL<>();

        DLLNode<Integer> tmp=list.getFirst();
        DLLNode<Integer> tmp2=list.getLast();

        int n=list.length()/2;

        while(n!=0){
            n--;
            if(tmp.element%2==0){
                evenList.insertLast(tmp.element);
            }else{
                oddList.insertLast(tmp.element);
            }
            tmp=tmp.succ;

            if(tmp2.element%2==0){
                evenList.insertLast(tmp2.element);
            }else{
                oddList.insertLast(tmp2.element);
            }
            tmp2=tmp2.pred;
        }
        if(list.length()%2!=0){
            if(tmp.element%2==0)
                evenList.insertLast(tmp.element);
            else
                oddList.insertLast(tmp.element);
        }
        System.out.println(evenList);
        System.out.println(oddList);
    }
    public static void main(String[] args) {
        Scanner in=new Scanner(System.in);
        int n=in.nextInt();
        DLL<Integer> list=new DLL<>();
        for(int i=0;i<n;i++){
            list.insertLast(in.nextInt());
        }

        podeli(list);
    }
}