#include <stdint.h>

#include <algorithm>

#include <vector>

#include <iostream>

#include <cstdio>

typedef int* iterator_t;

struct less_t {

bool operator() (const int& lhs, const int& rhs) const {

return lhs < rhs;

}

};

bool less_func(const int& lhs, const int& rhs) {

return lhs > rhs;

}

//(bool)less_func_t(const int& lhs, const int& rhs);

//typedef less_func_t less_t;

//template <typename less_type>

//void sort(iterator_t &begin, size_t size, less_type const &less);

template <typename less_type>

void sort(iterator_t begin, iterator_t end, less_type const &less) {

std::sort(begin, end, less);

}

/*

template <typename less_type>

void sort(iterator_t &begin, size_t size, less_t const &less) {

iterator_t end = begin;

for (size_t i = 0; i < size; ++i) {

++end;

// end = it + 1;

}

std::sort(begin, end, less);

}

*/

int main() {

std::vector<int> data;

// while (1) {

for(;;) {

std::string line;

std::getline(std::cin, line);

int value = 0;

sscanf(line.c_str(), "%d", &value);

// std::cin >> value;

if (std::cin.eof()) break;

data.push_back(value);

}

less_t less;

sort<less_t>(&data[0], &data[data.size()], less);

for (size_t i = 0; i < data.size(); ++i) {

std::cout << data[i] << std::endl;

}

return 0;

}