public class Queue {
    private int[] items = new int[5];
    private int first = -1; // index of first item in queue
    private int last = 0; // 1 + index of last item

    public boolean isEmpty() {
        return last <= 0;
    }

    public int get() {
        int val = items[first];
        for (int i = 0; i+1 < last; i++) {
            items[i] = items[i+1];
        }
        last--;
        if (last == 0) first--;
        return val;
    }

    public void add(int i) {
        if (last == 0) first++;
        items[last++] = i;
    }

    public void remove(int i) {
        if (i <= 0) return;
        get();
        remove(i - 1);
        }

    public static void main(String[] args) {
        Queue s = new Queue();
        s.add(3);
        s.remove(2);
    }
}