#include<bits/stdc++.h> using namespace std; int a[101]; void qsort(int left,int right){ if(left>=right) return; int x=a[left],i=left,j=right; while(i<j){ while(i<j&&a[j]>=x) j--; a[i]=a[j]; while(i<j&&a[i]<=x) i++; a[j]=a[i]; } a[i]=x; qsort(left,i-1); qsort(i+1,right); } int main(){ for(int i=1;i<=6;i++) { cin>>a[i]; } qsort(1,6); for(int i=1;i<=6;i++){ cout<<a[i]<<" "; } return 0; }