#include <stdio.h>
#include <stdlib.h>
#include <time.h>
int *m(int *arr, int n, int first, int last) {
	int middle, start, fina, j;
    int mas[100000];
    middle = (first+last) / 2;
    start = first;
    fina = middle+1;
    for (j=first; j<=last; j++)
        if ((start<=middle) && ((fina>last) || (arr[start]<arr[fina]))){
            mas[j] =arr[start];
            start++;
            }
        else{
            mas[j] = arr[fina];
            fina++;
            }
    for (j=first; j<=last; j++)
    arr[j] =mas[j];
    return arr;
    }
int *msort(int *arr, int n, int first, int last){
    if (first<last){
        msort(arr, n, first, (first+last) / 2);
        msort(arr, n,  (first+last) / 2+1, last);
        m(arr, n , first, last);
        }
        return arr;
    }
int main() {
    int arr[1000000], i, n;
    scanf("%d", &n);
    srand(time(NULL));
    for(i=0; i< n; i++){
        arr[i] = rand()%1000;
    }
    msort(arr,n, 0, n-1);
    for (i=0; i<=n-1; i++)
    printf("%d ", arr[i]);
    return 0;
}