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

    s=a[i];a[i]=a[j];a[j]=s;
  }
printf("%d",a[1]);
  for (i=2;i<=t;i++) printf(",%d",a[i]);
}
int main(){
	int p,q,m,i,n,j,k,a[1000],b[1000];
	scanf("%d",&n);
	for(i=0;i<n;i++){
	scanf("%d",&a[i]);
	}
	k=0;
	for(j=0;j<n;j++){
		if(a[j]%2!=0){
		b[k]=a[j];k++;
		}
	}
	int e;
for(p = 0 ; p <= (k-1) ; p++){
	for(q = 0; q < (k-1) - p; q++){
			if(b[q] > b[q+1]){
					e = b[q+1];
					b[q+1] = b[q];
					b[q] = e;
			}
	}
}
	for(m=0;m<(k-1);m++){
	printf("%d,",b[m]);
	}
	printf("%d",b[(k-1)]);
return 0;
}
int main()
{
	int n,z[500],j,i,w;
	scanf("%d",&n);
	for(i=0;i<n;i++)
		scanf("%d",&z[i]);
	for(j=0;j<n;j++)
	{
		for(i=j+1;i<n;i++)
			if(z[j]>z[i])
			{
				w=z[i];
				z[i]=z[j];
				z[j]=w;
			}
	}
	w=0;
    for(i=0;i<n;i++)
	{
		if(z[i]%2!=0)
		{
			if(w==0)
			printf("%d",z[i]);
			else
				printf(",%d",z[i]);
		}
		w++;
	}
               
	return 0;
}
int main()
{
	int i, n, j, k = 0, p, a[500] = {0}, b[500];
	for(i = 0 ; i < 500 ; i++)
	{
		b[i] = 10000000;
	}
	cin >> n;
	for(i = 0 ; i < n ; i++)
	{
		cin >> a[i];
	}
	for(j = 0 ; j < n ; j++)
	{
		if(a[j] % 2 == 1)
		{
			b[k] = a[j];
			k++;
		}
	}
	for(i = 0 ; i < n - 1 ; i++)
		for(j = 0 ; j < n - i - 1 ; j++)
		{
			if(b[j] > b[j + 1])
			{
				p = b[j];
				b[j] = b[j + 1];
				b[j + 1] = p;
			}
		}
	for(i = 0 ; i < k - 1 ; i++)
	{
		cout << b[i] << ",";
	}
	cout << b[k - 1];
	return 0;
}
int main(){
    int n,t,sum=0,m,i,a,k=0;
    scanf("%d\n",&n);
    int N[n];
    for(i=0;i<n;i++){
        scanf("%d",&N[i]);
        if(N[i]%2!=0)
            sum++;
    }
    int P[sum];
    for(i=0;i<n;i++){
        if(N[i]%2!=0){
            P[k]=N[i];
            k++;
        }
    }
    for(m=0;m<sum;m++)
    {
        for(i=sum-2;i>=0;i--)
        {
            if(P[i]>P[i+1])
            {
                a=P[i+1];
                P[i+1]=P[i];
                P[i]=a;
            }
        }
    }
    for(m=0;m<sum-1;m++)
    {
        printf("%d,",P[m]);
    }
    printf("%d",P[sum-1]);
    return 0;
}
int main(){
    int N;
    int sz[500];
    scanf("%d\n",&N);
    for(int i=0;i<N;i++){
        scanf("%d",&(sz[i]));
    }
    int odd[500],a=0;
    for(int x=0;x<N;x++){
        if(sz[x]%2==1){
            odd[a]=sz[x];
            a++;
        }
    }
    int num=0,e;
    for(int k=1;k<=a;k++){
        num=0;
        for(int y=0;y<=a-k;y++){
            if(odd[y]>=odd[num]){
                num=y;
            }
        }
        if(num!=a-k){
             e=odd[num];
             odd[num]=odd[a-k];
             odd[a-k]=e;
        }
    }
    for(int z=0;z<a-1;z++){
        printf("%d,",odd[z]);
    }
    printf("%d",odd[a-1]);
    return 0;
}
int main(){
int n;
cin>>n;
int w[100];int t=0;
for(int i=0;i<n;i++){int c;cin>>c;if(c%2){w[t]=c;t++;}}
sort(&w[0],&w[t]);
cout<<w[0];
for(int j=1;j<t;j++)cout<<','<<w[j];
return 0;
}
int main(){
	int N,i,e,l;
	scanf("%d",&N);
	int sz[500];
	for(i=0;i<N;i++){
		scanf("%d ",&sz[i]);
	}
	int js[500];
	int j=0;
	int n=0;
	for(i=0;i<N;i++){
		if(sz[i]%2==1){
			js[j]=sz[i];
			j=j+1;
			n=n+1;
		}
	}
	for(l=n-1;l>0;l--){
	for(j=0;j<l;j++){
		if(js[j]>js[j+1]){
			e=js[j+1];
			js[j+1]=js[j];
			js[j]=e;
		}
	}
	}
	for(j=0;j<n-1;j++){
		printf("%d,",js[j]);
	}
	printf("%d",js[n-1]);
	return 0;
}
int main()
{
	int n,a[500],k,i,j,b[500],c;
	j=0;
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%d",&a[i]);
		if(a[i]%2!=0)
		{
			b[j]=a[i];
			j=j+1;
		}
	}
	j=j-1;
	for(i=0;i<j;i++)
	{
		for(k=i;k<j;k++)
		{
			if(b[i]>b[k+1])
			{
				c=b[i];
				b[i]=b[k+1];
				b[k+1]=c;
			}
		}
	}
	for(i=0;i<j;i++)
	{
		printf("%d,",b[i]);
	}
	printf("%d",b[j]);


    return 0;

}
int main()
{
	int s[600];
	int i,k;
	int j=0;
	int n;
	int e,m,u;
	scanf("%d",&n);
	for (i=0;i<n;i++)
	{
		scanf("%d",&u);
		if (u%2!=0)
		{
			s[j]=u;
			m=j;
			j++;
		}
	}

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

   
   return 0;
   }
int main(){
    int sz[500];
	int i,r,s;
	int N;
	int e;
	scanf("%d",&N);
		for(i=0;i<N;i++){
			scanf("%d",&sz[i]);
		}
		for(r=0;r<N;r++){
			if(sz[r]%2==0){
				sz[r]=0;
			}
		}
		
		for(s=1;s<=N;s++){
		
			for(int q=0;q<N-s;q++){
				if(sz[q]>sz[q+1]){
					e=sz[q+1];
					sz[q+1]=sz[q];
					sz[q]=e;
				}
			}
		}
		for(int y=0;y<N-1;y++){
			if(sz[y]!=0){
				printf("%d,",sz[y]);
			}
			
		}
	
		printf("%d",sz[N-1]);
		
		return 0;
}
/*
 * shuzu2.1.cpp
 *
 *  Created on: 2013-11-2
 *      Author: st
 *      ??(14-3) ??????	
??	??-From Whf
??
???????N????500???????????????????????????
????
?2? 
?1?? N 
?2?? N ????????????? 
????
????????????????????
????
10

1 3 2 6 5 4 9 8 7 10

????
1,3,5,7,9
 */
int main()
{
	int n,i,j=0,k,l,t;
	cin>>n;
	int a[n],b[n];
	//for(i=0;i<n;i++)
		//b[i]=0;
	for(i=0;i<n;i++)
		cin>>a[i];

	for(i=0;i<n;i++)
		if(a[i]%2!=0)
			{b[j]=a[i];
			     //cout<<' '<<b[j]<<' ';
	         j++;}//??????????a????b??j????1???b????????j-1??
	              //cout<<j<<' ';
	for(k=1;k<=j-1;k++)
		for(l=0;l<=j-1-k;l++)
			if(b[l]>b[l+1])
				{
				t=b[l];
	            b[l]=b[l+1];
	            b[l+1]=t;
				}//cout<<l<<' '<<b[l]<<' '<<l+1<<' '<<b[l+1]<<' ';
	cout<<b[0];//????
	for(k=1;k<j;k++)
		cout<<","<<b[k];
	return 0;

}
int main()
{
    int N,number[500],i,k,min,odd[500],n,e;
    scanf("%d",&n);
    for(i=0;i<n;i++){
        scanf("%d",&number[i]);
    }
    k=0;
    for(i=0;i<n;i++){
        if(number[i]%2==1){
            odd[k]=number[i];
            k++;
        }
    }
    n=k;
    for(i=0;i<n;i++){
        min=i;
        for(k=i+1;k<n;k++){
            if(odd[min]>odd[k]){
                min=k;
            }
        }
        e=odd[min];
        odd[min]=odd[i];
        odd[i]=e;
    }
    for(i=0;i<n-1;i++){
        printf("%d,",odd[i]);
    }
    printf("%d",odd[n-1]);
    return 0;
}
int main()
{
	int a[500]={0},b[100]={0},c[100]={0},k,j,n,i,x,m,o,q,v;
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%d",&a[i]);
	}
	k=0;
	for(j=0;j<n;j++)
	{
		if(a[j]%2!=0)
		{
			b[k]=a[j];
			k=k+1;
		}
	}
	for(m=0;m<k;m++)
	{
		x=0;
		for(q=0;q<k;q++)
		{
			if(b[q]<b[m])
			x=x+1;
		}
		c[x]=b[m];
	}
	printf("%d",c[0]);
	for(v=1;v<k;v++)
	{
		printf(",%d",c[v]);
	}
	return 0;
}
int main(){
	int N,i,j,k,e;
	int a[100],b[100];
	k=0;
	scanf("%d",&N);
	for(i=0;i<N;i++){
		scanf("%d",&a[i]);
		if(a[i]%2!=0){
			b[k]=a[i];
			k=k+1;
		}
	}
	for(j=1;j<=k;j++){
		for(i=0;i<k-j;i++){
			if(b[i]>b[i+1]){
				e=b[i+1];
				b[i+1]=b[i];
				b[i]=e;
			}
		}
	}
	for(i=0;i<k-1;i++)
		printf("%d,",b[i]);
	printf("%d",b[k-1]);
	return 0;
}
int main ()
{int n,jn=0,mid;
scanf("%d",&n);
int shuzu[n],jishu[n];
for (int i1=0;i1<n;i1++)
{
scanf("%d",&shuzu[i1]);
if (shuzu[i1]%2==1)
{
jn=jn+1;
jishu[jn]=shuzu[i1];
for (int i2=jn;i2>1;i2--)
{if (jishu[i2]<jishu[i2-1])
{
mid=jishu[i2-1];
jishu[i2-1]=jishu[i2];
jishu[i2]=mid;
}

}
}
}
for (int i3=1;i3<jn;i3++)
{
printf("%d,",jishu[i3]);
}
printf("%d",jishu[jn]);
return 0;
}
int main()
{
int n,i,j,k,t,num;
int a[500];
cin>>n;
i=1;j=1;
for(i=1;i<=n;i++)
   {cin>>num;
   if(num%2!=0)
   {a[j]=num;
   j++;}
  }                                                                         //????????????????a??? 
for(i=1;i<=j-1;i++)
   for(k=1;k<=j-1-i;k++)
      if(a[k]>a[k+1])
         {t=a[k];
         a[k]=a[k+1];
         a[k+1]=t;
        }                                                                  //????? 
for(i=1;i<=j-2;i++)
     cout<<a[i]<<',';
cout<<a[j-1]<<endl;                                                        //??????????????????? 
return 0;
}
int main()
{
	int num[501];
	int up[501];
	int n,i1,i2,i3,t;
	scanf("%d", &n);
	i2=0;
	for(i1=0;i1<n;i1++)
	{
		scanf(" %d", &num[i1]);
		if(num[i1]%2==1)
		{
			up[i2]=num[i1];
			i2++;
		}
	}
	i3=0;
	while(i3<i2)
	{
		if(up[i3]>up[(i3)+1])
		{
			t=up[(i3)+1];
			up[(i3)+1]=up[i3];
			up[i3]=t;
			i3--;
			if(i3<0)
			{
				i3++;
			}

		}
		else
		{
			i3++;
		}
	}
	for(i3=1;i3<(i2);i3++)
	{
		printf("%d,",up[i3]);
	}
    printf("%d",up[i3]);
	return 0;
}
int main(){
    int a,b,n,c,d,e,f,g,sz[500],Sz[250];
	a=0;
	b=0;
	c=0;
	d=0;
	e=0;
	g=1;
	scanf("%d",&n);
	for(b=0;b<n;b++){
		scanf("%d",&sz[b]);
	}
	for(a=0;a<n;a++){
		
			if(sz[a]%2!=0){
				
			Sz[c]=sz[a];

			c++;
			}
		
	}
	for(d=0;d<c;d++){
		for(e=0;e<c;e++){
			if(Sz[e]>Sz[e+1]){
                  f=Sz[e];
				  Sz[e]=Sz[e+1];
				  Sz[e+1]=f;
			}
		}
	}
	for(g=1;g<c;g++){
		printf("%d,",Sz[g]);
	}
	printf("%d",Sz[c]);
	return 0;
}
int main(){
int i,n,m,l,p;
scanf("%d",&n);
int a[n],b[n];
m=0;
p=1;
for(i=0;i<n;i++){
   scanf("%d",&a[i]);
   if(a[i]%2==1){
   b[m]=a[i];
      if(p<b[m]){
        p=b[m];
        }
     m=m+1;
   }
}
for(i=1;i<p;i=i+2){
   for(l=0;l<m;l++){
      if(b[l]==i){
       printf("%d,",b[l]);
       }
    }
}
printf("%d",p);
return 0;
}
int a[xl];
int b[xl];
int main()
{
    int N,j,r,i,k,sum;
    scanf("%d",&N);
    sum=0;
    for(i=0;i<N;i++){
    scanf("%d",&a[i]);}
    for(i=0;i<N;i++)
    if (a[i]%2!=0){
    b[sum++]=a[i];
    }
    for(j=0;j<sum;j++){
        for(r=0;r<sum-j-1;r++){
            if(b[r]>b[r+1]){
                int e;
                e=b[r+1];
                b[r+1]=b[r];
                b[r]=e;
            }
       }
    }
    for(r=0;r<sum;r++){
        if(r==sum-1)
        printf("%d",b[r]);
        else
        printf("%d,",b[r]);
    }
    return 0;
}
int main(){
	int n,a[501],k=0,i,j,m,p,b,o;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d",&a[i]);
	}
	for(j=0;j<n;j++){
		   if(a[j]%2==1){
			   a[k]=a[j];
			   k++;
		   }
		}
	
	for(m=1;m<k-1;m++){
		for(o=0;o<k-m;o++){
			if(a[o]>a[o+1]){
				b=a[o];
				a[o]=a[o+1];
				a[o+1]=b;
			}
		}
	}
	for(p=0;p<k;p++){
		if(p==k-1){
			printf("%d",a[p]);
		}
		else printf("%d,",a[p]);
	}
	return 0;
}
int main(){
 int N,i,t,j;
 int sum=0; 
 scanf("%d",&N);
 int a[N];
 for(i=0;i<N;i++){
   scanf("%d ",&a[i]);
 }
int b[sum];
   for(i=0;i<N;i++){
      if(a[i]%2!=0)
      {
       sum++; 
       b[sum-1]=a[i];
      }
   }
for(j=0;j<sum-1;j++) {
   for(i=0;i<sum-j-1;i++){
       if(b[i]>b[i+1]){
           t=b[i];
           b[i]=b[i+1];
           b[i+1]=t;
       }
    }
   }
   for(i=0;i<sum-1;i++){
   printf("%d,",b[i]);}
   printf("%d",b[sum-1]);
 return 0;
}
int main(int argc, char* argv[])
{
	int n, i, j=0, k;
	int* piInput, *piOdd;

	scanf("%d", &n);

	piInput = (int*)calloc(n, sizeof(int));
	piOdd = (int*)calloc(n, sizeof(int));

	for (i=0; i<n; i++)
	{
		scanf("%d", &piInput[i]);
		if (piInput[i] %2 ==1)
		{
			piOdd[j++] = piInput[i];
		}
	}

	///sort
	for (i=0; i<j; i++)
	{
		for (k=i+1; k<j; k++)
		{
			if (piOdd[i]> piOdd [k])
			{
				n= piOdd[i];
				piOdd[i] = piOdd[k];
				piOdd[k]=n;
			}
		}
	}
	///print
	i=0;
	printf("%d", piOdd[i]);
	for (i=1; i<j; i++)
	{
			printf(",%d", piOdd[i]);
	}
	free(piInput);
	free(piOdd);

	return 0;
}
int main()
{
	int n,i,LEN;
	int a[500];
	int t[500];
	int j=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)
		 {
			 t[j]=a[i];
			 j=j+1;
		 }
	}

	LEN=j;

	int maxIndex, e;
    for(int k=1;k<=LEN;k++)
	{
	    maxIndex = 0;
	    for(int j=0;j<=LEN-k;j++)
		{
			if(t[j]>t[maxIndex])
			{
					maxIndex =j;
			}
		}	
	    if(maxIndex != LEN-k)
		{
		   e = t[maxIndex];
		   t[maxIndex] = t[LEN-k];
		   t[LEN-k]=e;
		}
	}

	for(j=0;j<LEN-1;j++)
	{
		printf("%d,",t[j]);
	}
	printf("%d",t[LEN-1]);








	return 0;
}
int main(){
    int n,i,t,d,m,j,k;
    scanf("%d",&n);
    int a[n];
    t=0;
    for(i=0;i<n;i++){
        scanf("%d",&(a[i]));
        d=a[i]%2;
        if(d==1){
            t=t+1;
        }
    }
    int b[t];
    m=0;
    for(i=0;i<n;i++){
        d=a[i]%2;
        if(d==1){
          b[m]=a[i];
          m=m+1;
        }
    }
    for(m=0;m<t;m++){
        for(j=t-1;j>m;j--){
            if(b[j]<b[j-1]){
                k=b[j];
                b[j]=b[j-1];
                b[j-1]=k;
            }
        }
    }
    for(m=0;m<(t-1);m++){
        printf("%d,",b[m]);
    }
    printf("%d",b[t-1]);
    return 0;
}
int main()
{
	int sz[MAX];
	int n,i,j,e,t;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d",&sz[i]);
	}
    for(i=1;i<=n;i++){
      for(j=0;j<n-i;j++){
        if(sz[j]>=sz[j+1]){
              e=sz[j];
              sz[j]=sz[j+1];
              sz[j+1]=e;
		}
	  }
	}
    for(i=n-1;i>0;i--){
		if(sz[i]%2!=0){
		   t=sz[i];
		  
		   break;
		}
	}
	for(i=0;i<n;i++){
        if(sz[i]%2!=0){
			if(sz[i]!=t)
				printf("%d,",sz[i]);
			else
			   printf("%d",sz[i]);
		}
	}
	return 0;
}
int main()
{
    int i,j,n,a[1000],num=0,temp;
    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
        scanf("%d",&a[i]);
    }
    for(i=0;i<n;i++)
    {
        if(a[i]%2==0)
        {
            a[i]=0;
            num++;
        }
    }
    for(i=0;i<n;i++)
    {
        for(j=i;j<n;j++)
        {
            if(a[i]>a[j])
            {
                temp=a[i];
                a[i]=a[j];
                a[j]=temp;
            }
        }
    }
    for(i=num;i<n;i++)
    {
        if(i==n-1) printf("%d",a[i]);
        else printf("%d,",a[i]);
    }
    return 0;
}
int main()
{
	int n,t,m=0;                      //n?????????????,t??????????,m????????
	int a[500];                       //??a??????
	cin>>n;                           //??n
	while(n--)
	{
		cin>>t;                       //??????
		if(t%2==1)
		{
			a[m++]=t;                 //???????a
		}
	}
	for(int i=0;i<m-1;i++)            //???a??????
	{
		for(int j=i+1;j<m;j++)
		{
			if(a[i]>a[j])
			{
				int p=a[i];
				a[i]=a[j];
				a[j]=p;
			}
		}
	}
	cout<<a[0];                       //???????
	for(int k=1;k<m;k++)              //???????
	{
		cout<<','<<a[k];
	}
	return 0;
}
//********************************************
//??????
/*???????N????500?????????
?????????????????*/
//********************************************
int main()
{
   int N,a[500]={0},i,j;//a[]??????,i?j????
   int b[500]={0},p;    //b[]????,p????
   cin>>N;
   for(i=0;i<N;i++)
   {
	   cin>>a[i];
	   if(a[i]%2!=0)
		   b[i]=a[i];
   }
   for(j=0;j<N;j++)           //?????????
   {
      for(i=0;i<N-j;i++)      //????
	  {
	     if(b[i]>b[i+1])      //??????
		 {
		    p=b[i];
			b[i]=b[i+1];
			b[i+1]=p;
		 }
	  }
   }
   for(i=0;i<=N;i++)         
   {
      if(b[i]!=0&&i!=N)
		  cout<<b[i]<<',';         //??????b[]
	  else if(b[i]!=0&&i==N)
		  cout<<b[i];              //?????
   }
   return 0;
}
void Sort(int b[],int n)
{
	int i,j,temp;
	for(i=0;i<n-1;i++)
	{
		for(j=0;j<n-i-1;j++)
		{
			if(b[j]>b[j+1])
			{
				temp=b[j];
				b[j]=b[j+1];
				b[j+1]=temp;
			}
		}
	}
}
int chouqu(int a[],int b[],int n)
{
	int count=0,i;
	for(i=0;i<n;i++)
	{
		if(a[i]%2==1)
		{
			b[count]=a[i];
			count++;
		}
	}
	return count;
}
int main()
{
	int a[501],n,i,b[501];
	cin>>n;
	for(i=0;i<n;i++)
	{
		cin>>a[i];
	}
	n=chouqu(a,b,n);
	Sort(b,n);
	cout<<b[0];
	for(i=1;i<n;i++)
	{
		cout<<","<<b[i];
	}
	cout<<endl;
	return 0;
}
int main(){
int n;
int i=0;
int bidaxiao[1000];
int a=0;
int b=0;
int c,d,e;
int max[1000];
scanf("%d",&n);
for(d=0;d<n;d++){
    scanf("%d",&c);
	if(c%2==1){
		bidaxiao[i]=c;
		i++;
	}
}
e=i;
while (b<n){
    for(i=0;i<e;i++){
        if(a<bidaxiao[i])
        a=bidaxiao[i];
    }
	for(i=0;i<e;i++){
		if(bidaxiao[i]==a)
			bidaxiao[i]=0;
		
	}
max[b]=a;
a=0;
b++;
}
for(i=0;i<e-1;i++)
printf("%d,",max[e-i-1]);
printf("%d",max[0]);
return 0;
}
int main()
{
	int n,x,y=0;
	int a[501],b[501];
	cin>>n;
	for(x=0;x<n;x++){
		cin>>a[x];
	}
	for(x=0;x<n;x++)
	{
		if(a[x]%2!=0){
			b[y]=a[x];
			y++;
		}

	}
	sort(b,b+y);
	cout<<b[0];
	for(x=1;x<y;x++)
		cout<<','<<b[x];
	return 0;
}
int main()
{
    int n , temp ;
    cin >> n ;
    int a[n] ;
    int i , j ;
    for ( i = 0 ; i < n ; i++ )
      {
          cin >> a[i] ;
      }
       for ( i = 0 ; i < n ; i++ )
          {
              for ( j = i + 1 ; j < n ; j++ )
                 {
                     if( a[i] > a[j] )
                        {
                            temp = a[i] ;
                            a[i] = a[j];
                            a[j] = temp ;
                        }//??????
                 }
          }
       for ( i = 0 ; i < n ; i++ )
          {
              if( a[i] % 2 != 0)
               {
                  cout << a[i] ;
                  break;//???????????
               }
          }
          for ( i = i + 1 ; i < n ; i++ )
          {
              if( a[i] % 2 != 0)
               {
                  cout << "," << a[i] ;//???????????????????
               }
          }

      return 0 ;
}
int main(){
    int a[500];
    int b[500];
    int i,n,t,j,k,s,min;
    scanf("%d",&n);
    for(i=0;i<n;i++){
        scanf("%d",&a[i]);             
                     }
    j=0;                 
    for(i=0;i<n;i++){
                     if(a[i]%2==1){b[j]=a[i];j++;t=j;}
                     }                 
    for(j=0;j<t;j++){
                     min=b[j];
                     s=j;
                     for(k=j+1;k<t;k++){if(b[k]<b[s]){min=b[k];s=k;}}
                     if(min<b[j]){b[s]=b[j];b[j]=min;}
    
                     }
    printf("%d",b[0]);
    for(j=1;j<t;j++)
    {printf(",%d",b[j]);}
  return 0;
    }
int main(){
    int n,k,e;
    int sz[500],a[500];
    scanf("%d\n",&n);
    k=0;
    for (int i=0;i<n;i++){
        scanf("%d",&(sz[i]));
    }
    for(int i=0;i<n;i++){
        if(sz[i]%2==1){
            a[k]=sz[i];
            k++;
        }
    }
    for(int l=0;l<=k;l++){
        for(int i=0;i<k-1;i++){
            if(a[i]>a[i+1]){
               e=a[i+1];
               a[i+1]=a[i];
               a[i]=e;
            }
        }
    }
    for(int i=0;i<k;i++){
        if(i==0){
            printf("%d",(a[i]));
        }
        else{
            printf(",%d",(a[i]));
        }        
    }
return 0;
}
int main(){
	int n;
	int a[501];
	int b[501];
	int temp;
	int i,j,k=0;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d",&a[i]);
		if(a[i]%2==1){
			b[k]=a[i];
			k++;
		}
	}
	for(i=0;i<k;i++){
		for(j=i+1;j<k;j++){
			if(b[j]<b[i]){
				temp=b[i];
				b[i]=b[j];
				b[j]=temp;
			}
		}
	}
	printf("%d",b[0]);
	for(i=1;i<k;i++){
		printf(",%d",b[i]);
	}
	return 0;
}
int N,a[500],t=0,i=0,j=0,k=0,x,y;
int main( )
{

	cin>>N;
	for(i=0;i<N;i++)
	{
		cin>>x;
		if(x%2==1) 
		{
		    a[t]=x;   //????
		    t++;
		}
	}
	for(j=0;j<t;j++)         //????
		for(k=0;k<t-j-1;k++)
		{
			if(a[k]>a[k+1])
			{
				y=a[k];
				a[k]=a[k+1];
				a[k+1]=y;
			}
		}
	for(k=0;k<t-1;k++)cout<<a[k]<<",";
	cout<<a[k];
	return 0;
}
int main()
{
	int n;
	scanf("%d",&n);
	int i,k,b,h,c;
	int*shuzu=(int*)malloc(sizeof(int)*n);
	for(i=0;i<n;i++){
		scanf("%d",&shuzu[i]);
	}
	int a=0;
	int*shuzu_=(int*)malloc(sizeof(int)*n);
	for(k=0;k<n;k++){
		if(shuzu[k]%2!=0){
			shuzu_[a]=shuzu[k];
			a++;
		}
	}
	a=a;
	int g;
	for(b=1;b<=a;b++){
		int e=0;
		for(c=0;c<=a-b;c++){
			if(shuzu_[c]>shuzu_[e]){
				e=c;
			}
		}
		if(e!=a-b){
			g=shuzu_[a-b];
			shuzu_[a-b]=shuzu_[e];
			shuzu_[e]=g;
		}
	}
	for(h=0;h<a-1;h++){
		printf("%d,",shuzu_[h]);
	}
	if(h=a-1){
		printf("%d",shuzu_[a-1]);
	}
	return 0;
}
int main()
{
    int m,i,a,r;
    
    int sz[500],hz[500];
    scanf("%d\n",&m);
    for(i=0;i<m;i++){
        scanf("%d",&(sz[i]));
       
    } 
    int j;
    j=0;
    for(i=0;i<m;i++){
        if(sz[i]%2!=0){
           
            hz[j]=sz[i];
            j++;
        }
    }
    for(a=j-1;a>0;a--){
        for(r=0;r<a;r++){
            if(hz[r]>hz[r+1]){
                int tmp=hz[r+1];
                hz[r+1]=hz[r];
                hz[r]=tmp;
            }
        }
    }
        
    
    for(i=1;i<=j-1;i++){
        printf("%d,",hz[i-1]);
    }
    printf("%d",hz[i-1]);
    return 0;
}
int main()
{
	int i,n,j=0,temp,len,num,a[1000];
	cin>>n;
	for(i=0;i<n;i++)
	{
		cin>>num;
		if(num%2==1)
		{
			a[j]=num;
			j++;			
		}
		if(i==n-1)
			len=j;
	}
	for(i=0;i<len-1;i++)
	{
		for(j=0;j<len-1-i;j++)
		{
			if(a[j]>a[j+1])
			{
				temp=a[j];
				a[j]=a[j+1];
				a[j+1]=temp;
			}
		}
	}
	cout<<a[0];
	for(i=1;i<len;i++)
		cout<<","<<a[i];
	cout<<endl;
	return 0;
}
int main(){int i,j,l,cout=0,n,c,k;
int a[500];scanf("%d",&n);
for(i=0;i<=n-1;i++){scanf("%d",&c);if(c%2!=0){a[cout]=c;cout++;}}

for(j=0;j<=cout-2;j++){for(k=cout-1;k>j;k--){if(a[k]<a[k-1]){a[k]=a[k]+a[k-1];a[k-1]=a[k]-a[k-1];a[k]=a[k]-a[k-1];}}}
for(l=0;l<=cout-2;l++){printf("%d,",a[l]);}printf("%d",a[cout-1]);return 0;}
/*
 * first.cpp
 *
 *  Created on: 2012-9-17
 *      Author: 120017625 ashley
 */

int main(){
    int n;
    cin>>n;
    int a[n];
    int i,j,num_odd,input;
    num_odd=0;
    for(i=1;i<=n;i++)//??????????? ????????
    {
        cin>>input;
        if(input%2==1)
        {
            num_odd=num_odd+1;//num_odd????????
            a[num_odd]=input;
        }
    }
    for(i=1;i<=num_odd;i++)//??????
    {
        for(j=1;j<num_odd;j++)
        {
            if(a[j]>a[j+1])
            {
                a[j]=a[j]+a[j+1];
                a[j+1]=a[j]-a[j+1];
                a[j]=a[j]-a[j+1];
            }
        }
    }
    for(i=1;i<=num_odd;i++)
    {
        if(i!=num_odd) cout<<a[i]<<',';//????
        else cout<<a[i];
    }
    return 0;
}
int main()
{
	int n,i,j,k,l,m;
	int a[500],b[500];
	scanf("%d",&n);
	for(i=0;i<n;i++)
	scanf("%d",&a[i]);
	printf("\n");
	for(i=0,j=0,k=0;i<n;i++)
	{if(a[i]%2==1)
	{b[j]=a[i];
	j++;
	k++;
	}
	}
	for(j=0;j<k;j++)
	{for(l=j+1;l<k;l++)
	{
	if(b[l]<b[j])
	{m=b[l];b[l]=b[j];b[j]=m;}
	}
	if(j==0)
		printf("%d",b[j]);
	else
	printf(",%d",b[j]);
	}
	printf("\n");
	return 0;
}
int main(){
    int n,i,k;
    int a,b,e;
    int sz[500];
    int jishu[500];
    scanf("%d",&n);
    for(i=0;i<n;i++){
        scanf("%d",&sz[i]);    
    }
       for(i=0;i<n;i++){
          if(sz[i]%2!=0){
            jishu[i]=sz[i];    
        }
        if(sz[i]%2==0){
            jishu[i]=0;    
        }
       }
    for(a=1;a<=n;a++){
        for(b=0;b<n-a;b++){
            if(jishu[b]>jishu[b+1]){
            e=jishu[b];
            jishu[b]=jishu[b+1];
            jishu[b+1]=e;
            }
        }
    }
    for(i=0;i<n-1;i++){
           if(jishu[i]!=0){
        printf("%d,",jishu[i]);
         }
    }
      printf("%d",jishu[n-1]);  
    
    
    return 0;
    
    
}
int main()
{
	int a[500],n,i,j,b,c=0,m,d,k;
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%d",&b);
		if(b%2!=0)
		{
			a[c]=b;
			c++;
		}

	}
	for(j=0;j<(c-1);j++)
	{
		for(m=0;m<(c-1-j);m++)
			if(a[m]>a[m+1])
			{
				d=a[m];
				a[m]=a[m+1];
				a[m+1]=d;
			}
				
	}
	for(k=0;k<c;k++)
	{
		printf("%d",a[k]);
		if(k!=(c-1))
			printf(",");
	}
	return 0;
}