import java.util.EmptyStackException;
import java.util.LinkedList;

public class Zad1
    {
    public static void main(String[] args)
    {
        Stos <Integer> stos = new Stos<Integer>();

        stos.dodajWartosc(5);
        stos.dodajWartosc(33);
        stos.dodajWartosc(11);
        stos.dodajWartosc(2);
        stos.dodajWartosc(3);

        System.out.println(stos.zdejmijWartosc());
        System.out.println(stos.zdejmijWartosc());

        System.out.println(stos.szczyt());

        System.out.println(stos);

        try {
        System.out.println(stos.zdejmijWartosc());
        System.out.println(stos.zdejmijWartosc());
        System.out.println(stos.zdejmijWartosc());
        System.out.println(stos.zdejmijWartosc());
        }catch(Exception e) {
            System.out.println(e.getMessage());
            System.exit(0);
        }
    }
}

class Stos <T>{
    LinkedList<T> stos = new LinkedList<T>();

    void dodajWartosc(T wartosc) {
        stos.add(wartosc);
    }

    T zdejmijWartosc() throws EmptyStackException{
        if(stos.size() == 0)
            throw new EmptyStackException();
        return stos.pollLast();
    }

    int liczbaElementow() {
        return stos.size();
    }

    T szczyt() throws EmptyStackException{
        if(stos.size() == 0)
            throw new EmptyStackException();
        return stos.peekLast();
    }

    public String toString() {
        String result = "";

        for(int i = stos.size()-1; i >= 0; i--) {
            result += stos.get(i) + " ";
        }

        return result;
    }
}