#include <stdio.h>
void insertionsort(int arr[], int n){
    int i, key, j;
    for (i = 1; i < n; i++){
        key = arr[i];
        j = i - 1;
        while (j >= 0 && arr[j] > key){
            arr[j + 1] = arr[j];
            j--;
        }
        arr[j + 1] = key;
    }
    
}
int main(){
    int n, i;
    int arr[100];
    if(scanf("%d", &n) != || n < 0){
        printf("Invalid input");
        return 0;
    }
    for (i = 0; i < n; i++){
        if(i == n - 1)
            printf("%d", arr[i]);
        else
            printf("%d ", arr[i]);
    }
    return 0;
}