#include <iostream>
using namespace std;

struct Node
{
	int data;
	Node* link;
};

typedef Node* NodePtr;

void head_insert(NodePtr& head, int the_number);
/* Precondition: The pointer variable head points to the head of a linked list.
 * Postcondition: A new node containing the_number has been added at the head of the linked list
 */

void insert(NodePtr after_me, int the_number);

void printList(NodePtr head);

int main()
{
	int numbers;
	NodePtr head = NULL;

	for(int i = 0; i < 5; i++)
	{
		cin >> numbers;
		if(head == NULL)
		{
			head_insert(head, numbers);
		}
		else
		{
			if(numbers > head->data)
			{
				//cout << "Need to sort.\n";
				NodePtr currNode = head;
				for(currNode; currNode != NULL; currNode = currNode->link)
				{
					if(numbers > currNode->data)
					{
						insert(currNode, numbers);
					}
					//printList(currNode);
				}
			}
			else
				head_insert(head, numbers);
		}
		//printList(head);
	}
	//insert(head->link->link, 12);
	//printList(head);
}

void head_insert(NodePtr& head, int the_number)
{
	NodePtr temp_ptr;
	temp_ptr = new Node;

	temp_ptr->data = the_number;

	temp_ptr->link = head;
	
	head = temp_ptr;
}

void printList(NodePtr head)
{
	NodePtr here;

	cout << "List contains:\n";
	for(here = head; here != NULL; here = here->link)
		cout << (here->data) << ' ';
	cout << endl;
}

void insert(NodePtr after_me, int the_number)
{	
	NodePtr temp_ptr;
	temp_ptr = new Node;

	temp_ptr->data = the_number;

	temp_ptr->link = after_me->link;
	after_me->link = temp_ptr;
}