#include<stdio.h>
#include<string>
#include <stdlib.h>
#include<iostream>
#include<string.h>
#include<algorithm>

using namespace std;
int s[10];

struct node {
	int element;
	struct node *next;
};

struct node* create() {
	struct node* head, *now, *pre;
	for (int i = 1; i <= 5; i++) {
		now = (struct node*)malloc(sizeof(node));
		now->element = s[i];
		if (i == 1)
		{
			head = now;
			pre = now;
			continue;
		}
		pre = now;
	}
	return head;
}

void print(struct node *head) {
	struct node *p;
	p = head;
	while (p != NULL){
		cout << p->element << endl;
		p = p->next;
	}
}

int main() {
	for (int i = 1; i <= 5; i++)
		cin >> s[i];
	sort(s, s + 5);
	struct node* head;
	head = create();
	print(head);
	return 0;
}