class StackDequeX {
  private int maxSize;
  private long[] stackArray;
  private int top;            //top of stack
  private int bottom;         //bottom of stack

//................................................................................

  public StackDequeX(int s) {                   //constructor
    maxSize = s;                           //set array size
    stackArray = new long[maxSize];        //create array
    top = 0;                              //no items yet
    bottom = 0;
  }

//.................................................................................
  //Putting Item on Top of Stack

  public void pushTop(long j)  {
      stackArray[top++] = j;
  }

//..................................................................................
  //Putting Item on Bottom of Stack

  public void pushBottom(long j) {
      if (bottom == 0) {
        bottom = maxSize - 1;
        stackArray[bottom] = j;
      }
      else {
          stackArray[--bottom] = j;
      }
  }

//...................................................................................
  //Remove item from top of stack

  public long popTop() {
    return stackArray[top--];
  }

//.................................................................................
  //Remove item from bottom of stack

    public long popBottom() {
      if (bottom == maxSize - 1) {
        return stackArray[bottom--];
      }
      else
    bottom = maxSize - 1;
    top--;
    return stackArray[bottom--];

  }

//.................................................................................

  public long peek() {              //peek at top of stack
    return stackArray[top];
  }

//.................................................................................

  public boolean isEmpty()  {      //true if stack is empty
    return (top == 0);
  }

//..................................................................................

  public boolean isFull()  {       //true if stack is full
    return (top == maxSize-1);
  }

//..................................................................................
  public void displayStack() {
    System.out.println(" ");
    System.out.println("Top: " + top);
    System.out.println("Bottom: " + bottom);
    int i = top;
    while(true) {
      if (i > 0) {
        i--;
      System.out.print(stackArray[i] + "\n");
      }
      else {
        i = maxSize - 1;
        System.out.print(stackArray[i] + "\n");
      }
      if(i == bottom)
        break;
    }
  }


}