using namespace std;
	template <class T>
	class stack {
		T *arr;
		int top;
		int size;
		public:
			stack(int=100);
			bool isEmpty(){if(top==0) return false ;else return true;}
			void destroy() { top=0; }
			void push(T&);
			bool isFull() {return top==size;}
			T pop();
			~stack();
	};

	template <class T>
	stack <T> :: stack(int stacksize)
	{
		size=stacksize;
		arr=new T[size];
		top=0;
	}

	template <class T>
	stack<T>::~stack()
	{
		delete [] arr;
	}

	template <class T>
	void stack<T> :: push (T& item)
	{
		arr[top++] = item;
	}

	template <class T>
	T stack<T> :: pop()
	{
		return arr[--top];
	}