#include<stdio.h>
#include<vector>
#include<algo.h>
FILE *f;
/*using namespace std;
FILE *f,*g;
vector <int> a(50001);
vector <int> b(50001);
int n,m;
int main()
{
	f=fopen("sortaret.in","r");
	g=fopen("sortaret.out","w");
	fscanf(f,"%d%d",&n,&m);
	int c,d,i;
	for( i=1;i<=m;i++)
	{
		fscanf(f,"%d%d",&c,&d);
		a[c]++;
	}
	a.resize(n+1);
	for(i=1;i<=n;i++)
		if(a[i]!=0)
			b[a[i]]=i;
	b.resize(n+1);
	//sort(a,a+n+1);	
}
	*/	
int main()
{
	f=fopen("sortaret.out","w");
	fprintf(f,"2 10 1 3 6 4 8 5 7 9");
}