#include<stdio.h>
int a[1000001],n;
void qsort(int left,int right)
{
    int t;
    int tmp=a[left];
    if(left>right)
        return;
    int i=left;
    int j=right;
    while(i!=j)
    {
        while(a[j]>=tmp&&i<j)
            j--;
        while(a[i]<=tmp&&i<j)
            i++;
        if(i<j)
        {
          t=a[i];
          a[i]=a[j];
          a[j]=t;
        }
    }
    a[left]=a[i];
    a[i]=tmp;
    qsort(left,i-1);
    qsort(i+1,right);
    return;
}
int main()
{
    scanf("%d",&n);
  int i,j,flag=0;
  for(i=1;i<=n;i++)
  {
      if(!flag){printf("%d",a[i]);flag++;}
      else printf(" %d",a[i]);
  }
  return 0;
}