#include <bits/stdc++.h>
using namespace std;
const int maxn = 10000001;
int a[maxn];
void insertion_sort(int a[], int n){
	for(int i = 2; i <= n; i++){
		int key = a[i];
		int j = i-1;
		while(j >= 1 && a[j] > key){
			a[j+1] = a[j];
			j--;
		}
		a[j+1] = key;
	}
}
int main(){
	int n;
	cin>>n;
	for(int i = 1; i <= n; i++) cin>>a[i];
	insertion_sort(a,n);
	for(int i = 1; i <= n; i++) cout<<a[i]<<" ";
	return 0;
}

成绩