#include <iostream>
using namespace std;
 
const int STACK_SIZE = 100;
class stack 
{
	private:
		int count;			// number of items in the stack
		int data[STACK_SIZE];
	public:
		stack();
		~stack();
		void push(const int item);	// push an item on the stack
		int pop(void);			// pop item off the stack
};
stack::stack()
{
	count = 0;	// zero the stack
}
stack::~stack() {}
void stack::push(const int item)
{
	if (count < STACK_SIZE)
	{
		data[count] = item;
		++count;
	}
	else cout << "Overflow!\n";
}
int stack::pop(void)
{
	if (count >0)
	{
		--count;
		return (data[count]);
	}
	else
	{
		cout << "Underflow!\n";
		return 0;
	}
}
 
 
 
 
 
 
 
 
void sort(int *x, int l)
{
	int length = l, old = 0, big;
	stack s;
	for (int i = 0; i <l; i++)
	{
		big = x[0];
		for (int j = 0; j <l; j++)
		{	
 
			if (x[j] > big)
			{
				big = x[j];
				old = j;
			}
		}
		s.push(big);
		x[old] = x[l-1];
		l--;
	}
 
	for (int i = 0; i <l; i++)
		x[i] = s.pop();
}
 
int main()
{
	int  a[21];
	int count = 0;
	do
	{
		cout << "Enter number "<<count+1<<", 0 to quit: ";
		cin >> a[count];
		count++;
	}
	while (a[count-1]!=0 && count <20);
 
 
 
	sort(a, count);
 
	for (int i = 0; i < count; i++)
		cout << a[i] << endl;
 
	return 0;
}