//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <cstdio>
#include <fstream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <string>
#include <climits>
#include <map>
#include <set>
#include <deque>
#include <tuple>
using namespace std;
#define sz(x) int(x.size())
#define beg(x) x.begin(), x.end()
#define pow2(x) ((x)*(x))
#define get_auto(x) for (auto& var : x) {cout<<var<<' ';}
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector < ll > vll;
typedef vector < int > vi;
typedef vector < pair<int, int> > vii;

bool cmp(const int &a,const int &b){
    return a>b;
}

int main() {
    vi v;
    int x;
    while(cin>>x){
        v.push_back(x);
    }
    vi v_copy = v;
    sort(beg(v_copy),cmp);
    get_auto(v_copy);
    cout<<endl;
    for (auto it = v.rbegin(); it != v.rend() ; ++it) {
        cout<<*it<<' ';
    }
}