//
//	Stack1.java
//	Array-based Stack: unsorted List, and operation -
//			"LIFO" (last in, first out) or "FILO"
//
public class Stack1
{
	private final int MAX = 50;
	// two instance variables
	private int[] info;
	private int length;
	// default constructor
	public Stack1()
	{	length = 0;
		info = new int[MAX];
	}
	public void push(int item)
	{	info[length] = item;
		length ++;
	}
	public int pop()
	{
		int item = info[length-1];
		length --;
		System.out.println(item + " was poped out.\n\n");
		return item;
	}
	public int getLength()
	{	return length;	}
	public void Print()
	{
		System.out.println("\n\n(Bottom  ---> Top)");
		for(int i=0; i<length; i++)
			System.out.print(info[i] + " ");
		System.out.println("\n\n");
	}
	public static void main(String[] args)	// driver
	{
		Stack1 z = new Stack1();
		z.push(12);
		z.push(7);
		z.push(15);
		z.push(2);
		z.push(100);
		System.out.println("Before pop, the list - ");
		z.Print();
		z.pop();
		System.out.println("After pop, the list - ");
		z.Print();
	}
}