semeru/Code-Code-CloneDetection-POJ104 huggingface dataset:
int main()
{
    int n,i,j,m,l,s;
    int a[MAX],b[MAX];
	j=0;
	scanf("%d",&n);
    for(i=0;i<n;i++){
        scanf("%d",&a[i]);
        if(a[i]<=0){
            return 0;
        }
		if((a[i]+1)%2==0){
			b[j]=a[i];
			j++;
		}
    }
    s=j-1;
    for(i=0;i<s;i++){
		for(l=i+1;l<j;l++){
			if(b[i]>b[l]){
            m=b[i];
			b[i]=b[l];
			b[l]=m;
			}
		}
	}
	for(i=0;i<s;i++){
		printf("%d,",b[i]);
	}
	printf("%d",b[s]);
    return 0;
}
void bubble_sort(int a[],int n)
{
	int i,k,t;
	for(k=n-1;k>0;k--){
		for(i=0;i<k;i++){
			if(a[i]>a[i+1]){
				t=a[i];
				a[i]=a[i+1];
				a[i+1]=t;
			}
		}
	}
		
}

int main()
{
	int i, n,a[MAX],u,j=0,b[MAX], m;
   scanf("%d",&n);
   for(i=0;i<n;i++){
      scanf("%d",&a[i]);
	  }
   bubble_sort(a,n);

   for(i=0;i<n;i++){    
	   if(a[i]%2!=0){
		b[j]=a[i];
		j++;
	   }
   }
    m=j;
		
	for(j=0;j<m;j++){ 
		if(j==0){
			printf("%d",b[j]);
		}
		else {
			printf(",%d",b[j]);
		
	}
   } 
   return 0;
}
int main(){
	int a[500],b[500],c[500],d[500],N,i,t,m,h,max;
	t=0;
	h=0;
	max=1;
	c[0]=1;
	scanf("%d",&N);
	for(i=0;i<N;i++){
		scanf("%d",&(a[i]));
	}
	for(i=0;i<N;i++){
		if(a[i]%2==1){
			b[t]=a[i];
			t++;
		}
	}
	for(i=0;i<=t;i++){
		if(b[i]>max){
			max=b[i];
		}
	}
    for(i=1;i<=(max-1)/2;i++){
		c[i]=c[i-1]+2;
	}
    for(i=0;i<=(max-1)/2;i++){
	for(m=0;m<=t;m++){
		        if(c[i]==b[m]){
				d[h]=c[i];
				h++;
			}
		}
	}
	for(i=0;i<h-1;i++){
	     printf("%d,",d[i]);
	}
	if(i=h-1){
		printf("%d",d[h-1]);
	}
	return 0;
}
int main(){
	int n,num[500],l,i;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d",&num[i]);
	}
	int t=0,m[500];
	for(i=0;i<n;i++){
		if(num[i]%2!=0){
			m[t]=num[i];
			t++;
		}
	}
	for(i=0;i<t;i++){
		for(l=t;l>i;l--){
			if(m[l]<m[l-1]){
				int k=m[l];
				m[l]=m[l-1];
				m[l-1]=k;
			}
		}
	}
	for(i=1;i<t;i++){
		printf("%d,",m[i]);
	}
	for(i=t;i<t+1;i++){
		printf("%d\n",m[i]);
	}
	return 0;
}
int a[600],cnt=0;
int main(){
	int n;
	cin>>n;
	for(int i=1;i<=n;i++){
		int lt;
		cin>>lt;
		if(lt%2)a[++cnt]=lt;
	}
	sort(a+1,a+cnt+1);
	for(int i=1;i<cnt;i++){
		cout<<a[i]<<',';
	}
	cout<<a[cnt];

}
int main()
{
    int N,n=0,c;
    cin>>N;
    int b[N];
    for (int i=0; i<N; i++) {
        cin>>c;
        if (c%2==1) {
            b[n]=c;
            n++;
        }
    }
    int a[n];
    for (int i=0; i<n; i++) {
        a[i]=b[i];
    }
    int m;
    for (int i=n; i>=0; i--) {
        for (int j=0; j<i-1; j++) {
            if (a[j]>a[j+1]) {
                m=a[j+1];
                a[j+1]=a[j];
                a[j]=m;
            }
        }
    }
    for (int i=0; i<n; i++) {
        if(i==n-1){
            cout<<a[i]<<endl;
        }else{
            cout<<a[i]<<',';
        }
    }
    return 0;
}
int main()
{
    int n,sz1[500],sz2[500],i,j,k,e,m;
    scanf("%d",&n);
	m=0;
	j=0;
    sz2[500]=0;
    for(i=0;i<=n-1;i++)
    {
        scanf("%d",&sz1[i]);
    }
    for(i=0;i<=n-1;i++)
	{
		if(sz1[i]%2!=0)
		{
			sz2[j]=sz1[i];
			j++;
			m=m+1;
		}
	}
	for(k=1;k<=m-1;k++)
	{
		for(j=0;j<=m-k-1;j++)
		{
			if(sz2[j]>sz2[j+1])
			{
				e=sz2[j+1];
				sz2[j+1]=sz2[j];
				sz2[j]=e;
			}
		}
	}
	for(j=0;j<=m-1;j++)
	{
		if(j==m-1)
		{
			printf("%d",sz2[j]);
		}else{
		    printf("%d,",sz2[j]);
		}
	}
    return 0;
}
int main()
{
	int a[10000];
	int n,w,m;
	int i,j,k,t,e,x,y;
	scanf("%d",&w);
	n=0;
	for(i=0;i<w;i++){
		scanf("%d",&a[i]);
	}
	for(k=0;k<w;k++){
		if((a[k]%2)!=0){
			n++;
		}else{
			a[k]=0;
		}
	}
	for(e=w-1;e>=0;e--){
		for(j=0;j<e;j++){
			if(a[j]>a[j+1]){
				m=a[j+1];
				a[j+1]=a[j];
				a[j]=m;
			}
		}
	}
	for(t=w-n;t<w-1;t++){
		printf("%d,",a[t]);
	}
	printf("%d",a[w-1]);



	return 0;
}
int main()
{
   int N,i,m;
   int b=0;
   int a[500];
   int tmp;
   scanf("%d\n",&N);
   for(i=0;i<N;i++)
   {
   scanf("%d",&a[i]);
   if(a[i]%2!=0)
        {
           a[b]=a[i];
           b++;
        }
   }
    for (m=0;m<b;m++)
          {
             for(i=1;i<b-m;i++)
             {   if(a[i-1]>a[i])
                 {
                   tmp=a[i-1];
                   a[i-1]=a[i];
                   a[i]=tmp;
                 }
             }
          } 
    for(i=0;i<b;i++)                
    {
         printf("%d",a[i]);
         if(i<b-1)
         printf(",");         }   
    return 0;
    
}
int main()
{
	int a[500],n,r,t=0;
	cin>>n;
	for(int i =0; i<=n-1;i++)
		cin >>a[i];

	for(int p =0; p<n-1;p++)
		for(int q =n-1;q>p;q--)
		{
			if(a[q]<a[q-1])
			{
				t=a[q];
				a[q]=a[q-1];
				a[q-1]=t;
			}
		}

if(a[0]%2!=0)
		cout<<a[0];
	for(int j = 1;j<=n-1;j++)
		if(a[j]%2!=0)
			cout <<","<<a[j];
	if(a[0]%2==0)
		for(int y =1; y<=n-1;y++)
			if(a[y]%2!=0)
			{	cout<<a[y];r=y;}
			     
			for(int m =r+1;m<=n-1;m++)
				if(a[m]%2!=0)
					cout <<","<< a[m];

				return 0;
}
int main()
{
	int n,m[500],w[500],i,k,j,q=0,b;
	scanf("%d",&n);
	for (i=0;i<n;i++)
	{
		scanf("%d",&m[i]);
	}
	for (
	 i=0;i<n;i++
	 ) 
	{
		if
			(
		m[i]%2!=0
		)
		{
		w[q]=m[i];
		q=q+1;
		}
	}
	b=q;
	for (
	 i=1;i<q+1;i++
	 ) 
	{
	for(
		j=i;j>0;j--
		)
	{
	if  (
		w[j-1]<=w[j]
		)
		{
					w[j]=w[j];
					w[j-1]=w[j-1];
		}
		else
		{ 
			k=w[j];
			w[j]=w[j-1];
			w[j-1]=k;
		}
	}
	}
for(
	 i=1;i<b;i++
	 )
{
	printf("%d,",w[i]);
}
printf("%d",w[b]);
		return 0;
}
int main ()
{
	int a[1000]={0};//????1000?????????????
	int N,k;//????n,k
	cin>>N;//??n
	int num=0;
	for(int i=1;i<=N;i++)//?for??????
	{
		cin>>k;
		if(k%2!=0)//???????????????????????
		{
			a[k]=k;
			num=num+1;//?????????
		}
		
	}
	int count=1;
	for(int i=1;i<1000;i++)//??????????????
	{
		if((a[i]!=0)&&(count==num))
		{
			cout<<a[i];
			
		}
		
		if((a[i]!=0)&&(count!=num))
		{
			cout<<a[i]<<',';
			count=count+1;
		}
		

		
	}
	return 0;
}
int main(){
	int N,n,k=1,i=0,j=0,a[500],b[500],e;
	scanf("%d",&N);
	for(i=0;i<N;i++){
		scanf("%d",&a[i]);
	}
	i=0;
	for(i=0;i<N;i++){
		if(a[i]%2!=0){
			b[j]=a[i];
			j++;
		}
	}
    n=j;
	i=0;
	for(k=1;k<=n;k++){
		for(i=0;i<n-k;i++){
			if(b[i]>b[i+1]){
				e=b[i];
				b[i]=b[i+1];
				b[i+1]=e;
			}
		}
	i=0;
	}
	for(i=0;i<n;i++){
		if(i!=n-1){
			printf("%d,",b[i]);
		}else{
			printf("%d",b[i]);
		}
	}

return 0;
}
int main(){
    int n,i;
    scanf("%d",&n);
    int sz[n];
    for(i=0;i<n;i++){
        scanf("%d",&(sz[i]));
    }
    int js[n],j;
    j=0;
    for(i=0;i<n;i++){
        if((sz[i])%2==1){
            js[j]=sz[i];
            j++;
        }
    }
    int k=j;
    int a,b;
    for(j=1;j<=k;j++){
        a=0;
        for(i=0;i<=k-j;i++){
          if(js[i]>js[a]){
          a=i;
          } 
          if(a!=k-j){
              b=js[a];
              js[a]=js[k-j];
              js[k-j]=b;
          }
        }
    } 
    for(j=0;j<k-1;j++){
        printf("%d,",js[j]);
    }
    printf("%d",js[k-1]);
    return 0;
}
int main()
{
	int n,i,j,t;
	int a[500];
	int b[500];
	int count=0;
	scanf("%d",&n);
	for(i=0;i<n;i++)
		scanf("%d",&a[i]);
	for(i=0;i<n;i++){
		if(a[i]%2){
			b[count]=a[i];
			count++;
		}
	}
	for(i=1;i<count;i++){
		for(j=0;j<count-i;j++){
			if(b[j]>b[j+1]){
				t=b[j];
				b[j]=b[j+1];
				b[j+1]=t;
			}
		}
	}
	printf("%d",b[0]);
	for(i=1;i<count;i++)
		printf(",%d",b[i]);
	return 0;
}
/*
 *????????????.cpp
 *?????
 *????: 2012-11-4
 *??????????????????
 */


int main(){
	//??????N???num?????i,j?????temp???a[510]
	int N, num, i, j, temp;
	int a[510];

	cin >> N;				//??N
	//??????????
	for (i = 0; i < N; i++)
	{
		cin >> num;
		a[i] = num;
	}
	//?????????????
	for (i = 0; i < N; i++)
	{
		for (j = 0; j < N - i - 1; j++)
		{
			if (a[j] > a[j + 1])
			{
				temp = a[j];
				a[j] = a[j + 1];
				a[j + 1] = temp;
			}
		}
	}
	//?????????????????
	for (i = 0; i < N; i++)
	{
		if (a[i] % 2 != 0)
		{
			if (i == 0)
				cout << a[i];
			else
				cout << "," << a[i];
		}
	}
	return 0;
}
int main()
{
	int N,e,i,m=0,q;
	int sz[500],js[500];
	scanf("%d",&N);
	for(i=0;i<N;i++){
		scanf("%d",&sz[i]);
	}
	for(i=0;i<N;i++){
		if(sz[i]%2==1){
			js[m]=sz[i];
			m++;
		}
	}
	for(int k=1;k<=m;k++){
		for(q=0;q<m-k;q++){
		if(js[q]>js[q+1]){
			e=js[q+1];
			js[q+1]=js[q];
			js[q]=e;
		}
	}
	}
	for(i=0;i<m;i++){
		if(i<m-1){
			printf("%d,",js[i]);
		}else{
			printf("%d",js[i]);
		}
	}
	return 0;
}
int main(){
    int n,as[500],k[500];
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	{
		scanf("%d",&(as[i]));
	}
	for(int j=0;j<n;j++)
	{
		for(int t=0;t<n-j;t++)
		{
			if(as[t]>as[t+1])
			{
				int e=as[t+1];
				as[t+1]=as[t];
				as[t]=e;
			}
		}
	}
	int y=0;
	for(int g=0;g<n;g++)
	{
		if(as[g]%2!=0)
		{
			k[y]=as[g];
			y++;
		}
	}
	for(int a=0;a<y;a++)
	{
		if(a!=y-1)
			printf("%d,",k[a]);
		else
			printf("%d",k[a]);
	}
	return 0;
}
int main(){
int i,j, k,l,e,x[1000],y[1000];
int N;
i=0;
j=0;
scanf("%d",&N);
for(i = 0; i < N; i++){
 scanf("%d ", &x[i]);
}
for(i=0;i<N;i++){
if(x[i]%2==1){
y[j]=x[i];
j=j+1;
}
}
k=j;
j=0;
l=1;
for(l=1;l<=k;l++){
for(j=0;j<k-l;j++){
if(y[j]>y[j+1]){
e=y[j+1];
y[j+1]=y[j];
y[j]=e;
}
}
}
for(j=0;j<k-1;j++){
printf("%d,",y[j]);
}
printf("%d",y[k-1]);
return 0;
}
int main()
{
	int n , i , j , a[501] , b[501] , count = 0 , temp;

	cin >> n;
	for (i = 0; i < n; i ++)
	{
		cin >> a[i];
		if (a[i] % 2 == 1)
			b[count ++] = a[i];
	}

	for (i = 0; i < count - 1; i ++)
	{
		for (j = 0; j < count - 1 - i; j ++)
		if (b[j] > b[j + 1])
		{
			temp = b[j + 1];
			b[j + 1] = b[j];
			b[j] = temp;
		}
	}
	cout << b[0];
	for (i = 1; i < count; i ++)
		cout << "," << b[i];
	cout << endl;

	return 0;
}
int main()
{
  int i,n,a[10000],b[1000],k,x,j;
  j=0;
  k=0;
  scanf("%d",&n);
  for(i=0;i<n;i++){
  	scanf("%d",&a[i]);
  }
  for(i=0;i<n;i++){
  	if(a[i]%2!=0){
  	b[k]=a[i];
  	k++;
  }else{
  k=k;
  }
  }
  n=k;
  while(j<=n){
  	for(i=0;i<n-1;i++){
  		if(b[i]<=b[i+1]){
  		b[i]=b[i];
  		b[i+1]=b[i+1];
  		}else{
  		x=b[i];
  		b[i]=b[i+1];
  		b[i+1]=x;
  		}
  	}
  	j++;
  }
  
   for(i=0;i<n-1;i++){
   	printf("%d,",b[i]);
   }
printf("%d",b[n-1]);
    
  	
   
  return 0;
    
}
int s[510];
int main(){
	int i,n,j,t;

	scanf("%d",&n);
	for (i=j=0;i<n;i++){
		scanf("%d",&t);
		if (t&1){
			s[j++]=t;
		}
	}
	sort(s,s+j);
	printf("%d",s[0]);
	for (i=1;i<j;i++){
		printf(",%d",s[i]);
	}
}
int main()
{
	long int c[100],i,j,numb,temp,k,f=0;
		scanf("%d",&numb);
	for (i=0;i<numb;i++)
		scanf("%ld",&c[i]);
	for (i=0;i<numb;i++)
		for (j=0;j<numb-i-1;j++)
		{
			if(c[j]>c[j+1])
			{
				temp=c[j];
				c[j]=c[j+1];
				c[j+1]=temp;
			}
		}
	for (k=0;k<numb;k++)
	{
		if (f!=0&&c[k]%2!=0)
			printf(",%d",c[k]);
		if (f==0&&c[k]%2!=0)
		{
			printf("%d",c[k]);
			f++;
		}

	}
	return 0;
}
/**
* @file 1000012800_1.cpp
* @author ??
* @date 2010-11-18
* @description
* ??????:????
*/


int main()
{
	int n , num[500], tmp, flag = 0;
	cin >> n;
	for (int i = 0; i < n; i ++)
	{
		cin >> num[i];
	}
	for (int i = 0; i < n; i ++)
	{
		for (int j = n - 1; j > i; j --)
		{
			if (num[j] < num[j - 1])
			{
				tmp = num[j];
				num[j] = num[j - 1];
				num[j - 1] = tmp;
			}
		}
	}
	for (int i = 0; i < n; i ++)
	{
		if (num[i] % 2)
		{
			if (!flag)
				cout << num[i];
			else
				cout << "," << num[i];
			flag ++;
		}
	}
	cout << endl;

		return 0;
}
int main()
{
    int N,i,j,k,t,count=0;
    cin>>N;                     //????????N 
    int a[N];                   //????a[N] 
    for (i=0;i<N;i++)
        {
         cin>>a[i];
         if (a[i]%2!=0)
            count=count+1;      //????????? 
        }
    int b[count];               //??????b[count] 
    k=0;
    for (i=0;i<N;i++)
        {
         if (a[i]%2!=0)
            {
             b[k]=a[i];
             k++;               //?a[N]???????b[count] 
            }
        }
    for (j=1;j<count;j++)
        {
         for (k=0;k<count-j;k++)
             {
              if (b[k]>b[k+1])
                 {
                  t=b[k];
                  b[k]=b[k+1];
                  b[k+1]=t;     //????b[count]???????? 
                 }
             }
        }
    for (k=0;k<count-1;k++)
        {
         cout<<b[k]<<",";
        }
    cout<<b[count-1]<<endl;     //???????? 
    return 0;
}
int main ()
{
	int sz[500];
	int u[500];
	int i,a=0,n,p,k,e;
	int s=0,z=0,sum;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d",&(sz[i]));
	}
	for(i=0;i<n;i++){
		if(sz[i]%2!=0){
			e=sz[i];
			u[a]=e;
			a++;
		}
	}
	for(k=1;k<=a;k++){
		for(i=0;i<a-k;i++){
			if(u[i]>u[i+1]){
				p=u[i+1];
				u[i+1]=u[i];
				u[i]=p;
			}
		}
	}
	for(i=0;i<a-1;i++){
		printf("%d,",u[i]);
		s+=u[i];
	}
	for(i=0;i<a;i++){
		z+=u[i];
	}
	sum=z-s;
	printf("%d",sum);

	return 0;
}
int main(){
	int LEN,sz[1000],i,j[500],l=0;
	scanf("%d",&LEN);
	for(i=0;i<LEN;i++){
		scanf("%d",&sz[i]);
	}
	for(int k = 1; k <= LEN; k++){
		int e;
		for(int i = 0; i < LEN - k; i++){
			if(sz[i] > sz[i+1]){
				e = sz[i+1];
				sz[i+1] = sz[i];
				sz[i] = e;
			}
		}

	}
	for(i=0;i<LEN;i++){
		if(sz[i]%2!=0){
			
			j[l]=sz[i];
			l++;
		}
	}
printf("%d",j[0]);
	for(i=1;i<l;i++){
		printf(",%d",j[i]);
	}
	return 0;
}
int main()
{
	int u[1000],v[1000];
	int n,i,j,a=0,max,e,b,c,d;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d",&u[i]);
	}
	j=0;
	for(i=0;i<n;i++){
		if(u[i]%2!=0){
             v[j]=u[i];
			 j++;
			 a++;
		}
	}
	max=0;
	b=0;
         d=a;
	while(b<d){
	for(j=0;j<a;j++){
		if(v[j]>v[max]){
			max=j;
		}
	}
	if(max!=a-1){
		e=v[max];
		v[max]=v[a-1];
		v[a-1]=e;
	}
	a--;
	b++;
	max=0;
	}
	for(c=0;c<d;c++){
		if(c<d-1){
		printf("%d,",v[c]);
		}else if(c==d-1){
			printf("%d",v[c]);
		}
	}
	return 0;
}
int main()
{
	int a[500],b[500],n,k,i,j=0,e;
		scanf("%d",&n);
		for(i=0;i<n;i++)
		{ scanf("%d",&a[i]);}
		for(i=0;i<n;i++)
		{
			if ((a[i])%2!=0)
			{
				b[j]=a[i],j++;
			}
		}

      for(k=1;k<n;k++)
	  {
		for(i=0;i<j-k;i++)
		{
			if(b[i]>b[i+1])
			{
				e=b[i+1],b[i+1]=b[i],b[i]=e;
			}
		}
	  }
	  for(i=0;i<j;i++)
	  {
		  printf("%d",b[i]);
		  if(i<j-1)
		  {
			  printf(",");
		  }
	  }
	return 0;
}
int main()
{
    int N;
    scanf("%d",&N);
    int input[500],deal[500];
    int k =0;
    for(int i =0;i<N;i++){
        scanf("%d",&input[i]);
           if(input[i]%2!=0)
             {
                 deal[k] = input[i];
                 k=k+1;
             }
        }
     int j,r;
     for(j=k-1;j>0;j--){
              for(r=0;r<j;r++){
                     if(deal[r]>deal[r+1])
                              {
                                     int t;
                                      t=deal[r+1];
                                     deal[r+1]=deal[r];
                                       deal[r]=t;
                                 }
                              }
                      }
for(int l = 0;l<k-1;l++){
    printf("%d,",deal[l]);
}
printf("%d",deal[k-1]);
return 0;
}
/*
 * main.cpp
 *
 *  Created on: 2012-11-3
 *      Author: GC
 *      ???????N????500???????????????????????????
 */


int main()
{
	int a[501];
	int i,k=0,n,j,x;

	cin >> n;
	for (i=1;i<=n;i++)
	{
		cin >> x;
		if (x%2==1)//?????????
		{
			k++;
			a[k]=x;
		}
	}
	for (i=1;i<=k;i++)//????
		for (j=i+1;j<=k;j++)
			if (a[i]>a[j])
			{
				a[0]=a[i];a[i]=a[j];a[j]=a[0];
			}
    for (i=1;i<=k-1;i++)
    	cout << a[i] << ',';
    cout << a[k] << endl;
	return 0;
}
int main(){
int a,n,i,e,j=0;
scanf("%d",&n);j=n;
int sz[500];
for(i=0;i<n;i++)
{
scanf("%d",&sz[i]);
}
for(i=0;i<n;i++)
{
if(sz[i]%2==0)
{
sz[i]=0;j=j-1;
}
}
for(a=1;a<=n;a++)
{
for(i=0;i<n-a;i++)
{
if(sz[i]>sz[i+1]){
e=sz[i+1];
sz[i+1]=sz[i];
sz[i]=e;}
}
}
for(i=n-j;i<n-1;i++)
{

printf("%d,",sz[i]);
}
printf("%d",sz[n-1]);
return 0;
}
void main()
{
	int n,m,i,j,k,t;
	int tt[500],pp[500];
	scanf("%d",&n);
	for(j=0,i=0;i<n;i++)
	{
		scanf("%d",&tt[i]);
		if((tt[i]%2)!=0)
		{
			pp[j]=tt[i]; j++;
		}
	}
	m=j;
	k=m;
	for(i=0;i<m-1;m--)
	{
		for(j=0;j<m-1;j++)
		{
			if(pp[j]>pp[j+1])
			{
				t=pp[j];
				pp[j]=pp[j+1];
				pp[j+1]=t;
			}
		}
	}
	for(i=0;i<k;i++)
	{
	   if(i==0) printf("%d",pp[i]);
	   else printf(",%d",pp[i]);
	}
	printf("\n");
}
int main( )
{ int a[500];
  int n,b,i,length=0;      //length???????
  cin >> n;
  for (i=0; i<n; i++)
  { cin >> b;
    if (b%2 == 1)          //???????????
    { a[length] = b;
      length++;
    }
  }
  sort(a,a+length);        //??
  cout << a[0];
  if (length>1)
  { for (i=1; i<length; i++)
    cout << ',' << a[i];
  }
  cout << endl;
  return 0;
}
int main(){
int shulie[500],jishu[500];
int n,t=0,i=0,j=0,a=0,c=0,k=0;
scanf("%d",&n);
for(i=0;i<n;i++)
  scanf("%d",&shulie[i]);
for(i=0;i<n;i++){
  if(shulie[i]%2!=0)
   c++;
}
i=0;
for(j=0;j<c;j++){
	for(a=i;a<n;a++){
		if(shulie[a]%2!=0){
			jishu[j]=shulie[a];
			break;
		}
	}
	i=a+1;
}
for(i=0;i<c-1;i++){
	for(j=i+1;j<c;j++){
		if(jishu[i]>jishu[j]){
			t=jishu[i];
			jishu[i]=jishu[j];
			jishu[j]=t;
		}
	}
	printf("%d,",jishu[i]);
}
printf("%d",jishu[c-1]);
return 0;
}
int main(){
int maxIndex, e,LEN,k,i;
int sz[1000],js[1000];
scanf("%d",&LEN);
for(i=0;i<LEN;i++){
scanf("%d", &sz[i]);
}
for(int k  =   1  ;   k <=   LEN; k++){
	maxIndex = 0;
	for(int i = 0; i <= LEN-k; i++){
			if(sz[i] > sz[maxIndex]){
					maxIndex = i;
			}
	}	
	if(maxIndex != LEN-k){
		e = sz[maxIndex];
		sz[maxIndex] = sz[LEN-k];
		sz[LEN-k] =  e;
	}
}
k=0;
for(i=0;i<LEN;i++){
if(sz[i]%2!=0){
js[k]=sz[i];
k++;
}
}
if(k<2){
for(i=0;i<k;i++){
printf("%d",js[i]);
}
}
if(k>1){
for(i=0;i<k-1;i++){
printf("%d,",js[i]);
}
printf("%d",js[k-1]);
}
return 0;
}
int main(){
int n;
 scanf("%d",&n);
int b=0;
int sz[n],js[b]; 
  for(int i=0;i<n;i++){
       scanf("%d",&(sz[i]));
      if(sz[i]%2!=0){
              
              js[b]=sz[i];
               b=b+1;
                }
         }
  for(int m=1;m<=b;m++){
                    int maxIndex,e;
                    maxIndex=0;
                   for(int i=0;i<=b-m;i++){
                        if(js[i]>js[maxIndex]){
                                maxIndex=i;
                               }
                       } 
                  if(maxIndex!=b-m){
                     e=js[maxIndex];
                     js[maxIndex]=js[b-m];
                     js[b-m]=e;
                               }
                }

for(int m=0;m<b-1;m++){
printf("%d,",js[m]);
}
printf("%d",js[b-1]);
return 0;
}
/*
 * 1.cpp
 *
 *  Created on: 2012-10-8
 *      Author: Lixurong
 */


int runnian( int a );

int main()
{
	int n;//????
	cin >> n;//??
	int a[n], b[n], k=0;//????
	for( int i=0; i<n; i++ )//??
	{
		cin >> a[i];//??
		if( a[i]%2!=0 )//??
		{
			b[k]=a[i];//???????
			k++;
		}
	}
	for( int i=0; i<k-1; i++ )//??????
	{
		for( int j=0; j<k-1; j++ )
		{
			if( b[j]>b[j+1] )//??
			{
				int h=b[j+1];
				b[j+1]=b[j];
				b[j]=h;
			}
		}
	}
	for( int i=0; i<k; i++ )//??
	{
		cout << b[i];
		if( i!=k-1 )
			cout << ",";
	}

	return 0;
}
int main(){
int N,i,k,e,p;
k=0;
scanf("%d",&N);
int a[500],b[500];
for(i=0;i<N;i++){
scanf("%d",&(a[i]));
if(a[i]%2!=0){
b[k]=a[i];
k++;}}
for(i=0;i<k;i++){
for(p=0;p<k-i;p++){
if(b[p]>b[p+1]){
e=b[p];
b[p]=b[p+1];
b[p+1]=e;}}}
for(i=1;i<k;i++){
printf("%d,",b[i]);}
printf("%d",b[k]);
return 0;
}
int main(){
	int N,z[H],i,k,c;
	scanf("%d",&N);
	for(i=0;i<N;i++){
		scanf("%d",&z[i]);
	         } 
	for(k=1;k<=N;k++){
		for(i=0;i<N-k;i++){
			if(z[i]%2!=0&&z[i]<z[i+1]){
				c=z[i];
				z[i]=z[i+1];
				z[i+1]=c;
				
			}else if(z[i]%2!=0&&z[i+1]%2==0){
			c=z[i];
				z[i]=z[i+1];
				z[i+1]=c;
				
			}
		}
	}
		for(k=N-1;k>=0;k--){
			if(z[k-1]%2!=0){printf("%d,",z[k]);
				}
				else {
					printf("%d",z[k]);
					return 0;
				}
			
				}
			return 0;
	
}
int main(){
    int n,zhan,k=0,i=0,j=0;
    scanf("%d",&n);
    int s[n];
    while(i<n){
        scanf("%d",&zhan);
        if(zhan%2==1){
            s[k]=zhan;
            k=k+1;
        }
        i=i+1;
    }
    i=0;
    while(i<k){
        while(j<k-1){
            if(s[j]<s[j+1]){
                zhan=s[j];
                s[j]=s[j+1];
                s[j+1]=zhan;
            }
            j=j+1;
        }
        j=0;
        i=i+1;
    }
    i=k-2;
    printf("%d",s[k-1]);
    while(i>=0){
        printf(",%d",s[i]);
        i=i-1;
    }
    return 0;
}
int main(){
   int n;
   scanf("%d",&n);
   int sz[n];
   for(int i=0;i<n;i++){
       scanf("%d ",&(sz[i]));
   }
   int js[n];
   int i,m;
   for(m=0,i=0;i<n;i++){
       if(sz[i]%2!=0){
           js[m]=sz[i];
           m++;
       }
   }
   int e;
   for(int k=1;k<=m;k++){
       for(i=0;i<m-k;i++){
           if(js[i]>js[i+1]){
               e=js[i];
               js[i]=js[i+1];
               js[i+1]=e;
           }
       }
   }
   printf("%d",js[0]);
   for(i=1;i<m;i++){
       printf(",%d",js[i]);
   }
   return 0;
}
int main()
{ 
	long a[1000],i,j,k,n,s=0,t,tt;

	scanf("%d",&n);
	for (i=1;i<=n;i++) 
	{
		scanf("%ld",&k);
		if (k%2) {s++;a[s]=k;}
	}

	for(i=1;i<=s;i++) 
		for (j=1;j<=s-i;j++)
			if (a[j]>a[j+1])
			{ tt=a[j];
	          a[j]=a[j+1]; 
			  a[j+1]=tt;
			   
			 } 
	printf("%d",a[1]); for (i=2;i<=s;i++) printf(",%d",a[i]); 
	
  return 0;
}
int main()
{
	int a[501] = { 0 };
	int i , n , j , flag , max;
	cin >> n;
	max = 0;
	for (i = 1; i <= n; i++)
	{
		cin >> j;
		if (j > max) 
			max = j;
		if (j % 2 == 1)
			a[j] ++;
	}
	flag = 1;
	for (i = 1; i <= max; i += 2)
		if (a[i] != 0)
			if (flag == 1)
			{
				flag = 0;
				cout << i;
			}
			else
			cout << "," << i;
	cout << endl;
	
	return 0;
}
/*
Name:???
ID:1200012842
Email:443972553@qq.com
*/
void swap(int *data,int a,int b)
{
     int t=data[a];
     data[a]=data[b];
     data[b]=t;
     }
int main()
{
    int n;
    cin>>n;
    int data[501];
    for (int i=0;i<n;i++)
        cin>>data[i];
    for (int i=n-1;i>=0;i--)
        for (int j=0;j<i;j++)
            if (data[j]>data[j+1])
               swap(data,j,j+1);
    int count=0;
    for (int i=0;i<n;i++)
        if (data[i]%2)
           if (count++)
              cout<<','<<data[i];
           else 
              cout<<data[i];
    
    return 0;
    }
int main()
{
	int a[500],b[500],n,i,j,p,q,k=0,h=0,l;
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%d",&a[i]);
	}
	for(j=0;j<n;j++)
	{
		if(a[j]%2!=0)
		{
			b[k]=a[j];
			k=k+1;
		}
		else
			continue;
	}
	for(p=0;p<k;p++)
	{
		for(q=p;q<k;q++)
		{
			if(b[p]>b[q])
			{
				h=b[p];
		    	b[p]=b[q];
				b[q]=h;
			}
			else 
				continue;
		}
	}
	for(l=0;l<k;l++)
	{
		if(l==k-1)
		printf("%d",b[l]);
		else
			printf("%d,",b[l]);
	}
	return 0;
}
int main()
{int s[500],N,sum=-1,z[500],m=0,a,b;
scanf("%d\n",&N);
for(int i=0;i<N;i++){
    scanf("%d",&(s[i]));
    }
for(int i=0;i<N;i++){
    if( s[i]%2==1){
        sum=sum+1;
    z[sum]=s[i];
    m=m+1;
    }
}
    for(int k=0;k<m;k++){
        for (int j=0;j<m-1;j++){
            a=z[j];
            b=z[j+1];
            if (z[j]>z[j+1]){
              z[j]=b;
              z[j+1]=a;
            }
}
}
 for(int j=0;j<m-1;j++){
        printf("%d,",z[j]);
    }
    printf("%d",z[m-1]);
        return 0;

}
int main()
{
	int N, a[500], i;
	cin>>N;
	for (i = 0; i < N; i ++)
	{
		cin>>a[i];
	}
	int b[500], j, k = 1;
	for (j = 0; j < N; j ++)
	{
		if (a[j] % 2 != 0)
		{
			b[k] = a[j];
			k ++;
		}
	}
	int c, d, e;
	for (c = 1; c < k; c ++)
	{
		for (d = 1; d < k - c; d ++)
		{
			if (b[d] > b[d+1])
			{
				e = b[d]; b[d] = b[d+1]; b[d+1] = e;
			}
		}
	}
	int t;
	for (t = 1; t < k - 1; t ++)
	{
		cout<<b[t]<<',';
	}
	cout<<b[k - 1]<<endl;
	return 0;
}
int main(){
    int n,i,e,k=0,x=0;
    scanf("%d",&n);
    int a[n];
    for(i=0;i<n;i++){
        scanf("%d",&(a[i]));
    }
    for(int k=1;k<=n;k++){
        for(i=0;i<n-k;i++){
            if(a[i]>a[i+1]){
                e=a[i+1];
                a[i+1]=a[i];
                a[i]=e;
            }
        }
    }
    for(i=0;i<n;i++){
        if((a[i])%2==1){
            k++;
        }
    }
    int b[k];
    for(i=0;i<n;i++){
        if((a[i]%2)==1){
            b[x]=a[i];
            x++;
        }
    }
    for(i=0;i<k-1;i++){
        printf("%d,",b[i]);
    }
    printf("%d",b[k-1]);
    return 0;
}
int main(){
	int sz[500];
	int i,n,k,e;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d",&sz[i]);}
	for(k=1;k<n;k++){
	for(i=0;i<n-k;i++){
		if(sz[i]>sz[i+1]){
		e=sz[i];
			
		sz[i]=sz[i+1];
		sz[i+1]=e;}}
	}
	
		
		for(i=0;i<n;i++){
			if(sz[i]%2!=0){
				printf("%d",sz[i]);
				break;}}
		for(i++;i<n;i++){
			if(sz[i]%2!=0){
				printf(",%d",sz[i]);}}
return 0;
}