class Queue
  {
    public int N;
    public int[] q;
    public int head, tail;
    Queue(int maxN)
      {
        q = new int[maxN+1];
        N = maxN+1; head = N; tail = 0;
      }    
    boolean empty()
      { return head % N == tail; }
    void put(int v)
      { q[tail++] = v; tail = tail % N; }
    int get()
      { head = head % N; return q[head++]; }
  }