semeru/Code-Code-CloneDetection-POJ104 huggingface dataset:
int main(){
	int a[500]={0},b[500]={0};
	int n,i,m=0,j,temp;
	scanf("%d",&n);
	for(i=0;i<n;i++){
	scanf("%d",&a[i]);
	if(a[i]%2==1){
	b[m]=a[i];
	m++;
	}}
	for(j=1;j<m;j++){
for(i=0;i<m-j;i++){
if(b[i]>b[i+1]){
temp=b[i];
b[i]=b[i+1];
b[i+1]=temp;
}
}
}  
	printf("%d",b[0]);
	for(j=1;j<m;j++){
	printf(",%d",b[j]);
	}
		return 0;
}
int main()
{
	int n;
	int sz[500];
	int m=0;
	scanf("%d",&n);
	for(m=0;m<n;m++){
		scanf("%d",&(sz[m]));
	}
	int e;
	for(int k=1;k<=n;k++){
		for(int i=0;i<n-k;i++){
			if(sz[i]>sz[i+1]){
				e=sz[i+1];
				sz[i+1]=sz[i];
				sz[i]=e;
			}
		}
	}
	int a=0;
	int j[500];
	int b=0;
	for(b=0;b<n;b++){
		if(sz[b]%2!=0){
			j[a]=sz[b];
			a++;
		}
		else{
			sz[b]=sz[b];
		}
	}
	int c=0;
	for(c=0;c<a-1;c++){
		printf("%d,",j[c]);
	}
    printf("%d",j[c]);
	return 0;
}
int main(){
	int n,i,j,count;
	scanf("%d",&n);
	int sz[500];
	for (i=0;i<n;i++){
		scanf("%d",&sz[i]);
	}
	j=0;
	count=0;
	int jishu[500];
	for(i=0;i<n;i++){
		if(sz[i]%2==1){
			jishu[j]=sz[i];
			j++;
			count++;
		}
	}
	for(i=1;i<=count;i++){
		for (j=0;j<count-i;j++){
			if(jishu[j]>jishu[j+1]){
				int e;
				e=jishu[j+1];
				jishu[j+1]=jishu[j];
				jishu[j]=e;
			}
		}
	}
	for(j=0;j<count;j++){
		if(j==0){
		printf("%d",jishu[j]);
		}else {
			printf(",%d",jishu[j]);
		}
	}
	return 0;
}
int main (){
	int n;
	int i=0;
	int s[500];
	int m=0;
	int q[500];
	int j;
	int t;
	int z;
	int u;
	scanf ("%d",&n);
	while (i<n){
        scanf ("%d",&s[i]);
		z=s[i]%2;
		if (z==1){
			m=m+1;
			j=m-1;
			q[j]=s[i];
		}
		
		i++;
	}
    j=1;
	while (j<m){
		u=j;
		while (j>0){

		    if (q[j]<q[j-1]){
		    	t=q[j-1];
			    q[j-1]=q[j];
		    	q[j]=t;
			}
			j--;
		}
		j=u+1;
	}
	j=0;
	while (j<m){
		if (j==m-1){
			printf ("%d",q[j]);

		}	else {

	     	printf ("%d"",",q[j]);
		}
	    j++;
	}
	return 0;
}
int main()
{
	int n,i,j,k;
	int a[500];
	int b[500];
	int t;
	int count=0;
	scanf("%d",&n);
	for (i=0;i<n;i++)
	{
		scanf("%d",&a[i]);
			b[i]=0;
	}
	
	for (i=0;i<n;i++)
	{
		for (j=0;j<n;j++)
		{
			if (a[i]<a[j])
			{
				t=a[i];a[i]=a[j];a[j]=t;
			}
		}
	}
k=0;
 for (i=0;i<n;i++)
 {
	 if(a[i]%2!=0)
	 {
		 b[k]=a[i];
		 k++;
		 count++;
	 }
 }
 for (k=0;k<count;k++)
 {
	 if (k==0)
	 {
		 printf("%d",b[k]);
	 }
	 else
	 printf("%c%d",',',b[k]);
 }
	

return 0;
}
int main()
{
    int N,e;
	int sz[501];
	scanf("%d",&N);
	for(int i=0;i<N;i++)
		scanf("%d",&(sz[i]));
	for(int k=1;k<=N;k++)
	{
		for(int i=0;i<N-k;i++)
		{
			if(sz[i]>sz[i+1])
			{
				e=sz[i+1];
				sz[i+1]=sz[i];
				sz[i]=e;
			}
		}
	}
    int flag = 0;
	for(int i=0;i<N;i++)
	{
		if(sz[i]%2!=0)
        {
            if (flag == 0)
            {
		    	printf("%d",sz[i]);
                flag = 1;
            }
            else
                printf(",%d", sz[i]);
	    }
	}
	return 0;
}
//**********************************
//****       ??????     *****
//****        1200016612       *****
//**      ?????????      **
//**********************************
int main()                                                          //?????
{
	int N=0,a[500],b[500],i=0,j=0,k=0,t=0;                          //a[500]???????b[500]????
	cin>>N;
	for(i=0;i<N;i++)                                                //??????????????b[500]????
	{
		cin>>a[i];
		if(a[i]%2!=0)
		b[j++]=a[i];
	}
	for(i=1;i<=j-1;i++){                                          //????????
		for(k=0;k<j-i;k++){                                       //????????
			if(b[k]>b[k+1]) 
			{
				t=b[k];
				b[k]=b[k+1];
				b[k+1]=t;
			}
		}
	}
	cout<<b[0];                                                      
	for(k=1;k<j;k++)
	{
		cout<<","<<b[k];
	}
	return 0;
}
int main()
{
    int N,e;
    int a[500],b[500];
    scanf("%d",&N);
    int i=0,t=0;
    while(i<N){
    scanf(" %d",&a[i]);
    if(a[i]%2!=0){
    b[t]=a[i];
    t++;
    }
    i++;
    }
    int s=1;
    while(s<=t){
    int r=0;
    while(r<t-s){
    if(b[r]>b[r+1]){
    e=b[r+1];
    b[r+1]=b[r];
    b[r]=e;
    }
    r++;
    }
    s++;
    }
    int u=0;
    while(u<t){
    if(u==0){
    printf("%d",b[0]);
    }else{
    printf(",%d",b[u]);
    }
    u++;
    }
    return 0;
}
int main()
{
    int n;
    scanf("%d", &n);
    int qtt[n], a;
    for (a=0; a<n; a++) {
        scanf("%d", &qtt[a]);
    }
    int s=0, b;
    for (b=0; b<n; b++) {
        if (qtt[b]%2==1) {
            s++;
        }
    }
    int odd[s], c, d=0;
    for (c=0; c<n; c++) {
        if (qtt[c]%2==1) {
            odd[d]=qtt[c];
            d++;
        }
    }
    int j, r;
    for (j=s-1; j>0; j--) {
        for (r=0; r<j; r++) {
            if (odd[r]>odd[r+1]) {
                int tmp;
                tmp=odd[r+1];
                odd[r+1]=odd[r];
                odd[r]=tmp;
            }
        }
    }
    int e;
    for (e=0; e<s-1; e++) {
        printf("%d,", odd[e]);
    }
    printf("%d", odd[s-1]);
    return 0;
}
int main(){
	int N,sz[500],i,s[500],k,max,e,f=0;
	scanf("%d",&N);
	for(i=0;i<N;i++){
		scanf("%d",&(sz[i]));
	}
	k=0;
	for(i=0;i<N;i++){
		if(sz[i]%2!=0){
				s[k]=sz[i];
				k++;
			}
		}
	for(f=1;f<=k;f++){
		max=0;
		for(i=0;i<=k-f;i++){
			if(s[i]>s[max]){
			max=i;
			}
		}
		if(max!=k-f){
		e=s[max];
		s[max]=s[k-f];
		s[k-f]=e;
		}
	}
	printf("%d",s[0]);
	for(i=1;i<=k-1;i++){
		printf(",%d",s[i]);
	}
	return 0;
}
int main()
{
    int N,i,t,p,q,sz[500],js[500];
    t=-1;
    scanf("%d\n",&N);
    for(i=0;i<N;i++){
        if(i<N-1){ 
           scanf("%d ",&sz[i]);
        }else{
           scanf("%d\n",&sz[i]);
        }
    }
    for(i=0;i<N;i++){
        if(sz[i]%2==1){
           t++;
           js[t]=sz[i];
        }
    }
    for(q=1;q<=t+1;q++){
    for(p=0;p<t;p++){
        if(js[p]>js[p+1]){
          int e=js[p];
          js[p]=js[p+1];
          js[p+1]=e;
        }
    }
    }
    for(p=0;p<=t;p++){
            if(p<t){
               printf("%d,",js[p]);
            }else{
               printf("%d",js[p]);
            }
     }
    return 0;
}
int main(){
	int n,e,i,c,a[500],b[500];
	scanf ("%d",&n);
	for(i=0;i<n;i++){
		scanf ("%d",&a[i]);
	}
	c=0;
	for(i=0;i<n;i++){
		b[i]=0;
	}
	for(i=0;i<n;i++){
		if (a[i]%2!=0){
			b[c]=a[i];
			c++;
		}
	}
    for(int o = 1 ; o <= c ; o++){
	    for(i = 0; i < c - o; i++){
			    if(b[i] < b[i+1]){
					    e = b[i+1];
					    b[i+1] = b[i];
					    b[i] = e;
				}
		}
	}
	i=c-1;
	while (i>=0){
		if (i>0){
			printf("%d,",b[i]);
		}else {
			printf("%d",b[i]);
		}
		i--;
	}


return 0;
}
int main(){
    int n,a=0,b=0,e;
    scanf("%d",&n); 
    int sz[n-1];
    for(int i=0;i<n;i++){
        scanf("%d",&sz[i]);
    }
    for(int i=0;i<n;i++){
        if(sz[i]%2==1){
            a++;
        }
    }
    int jsz[a];
    for(int i=0;i<n;i++){
        if(sz[i]%2==1){
            jsz[b]=sz[i];
            b++;   
        }
    }
    for(int i=0;i<a-1;i++){
        for(int j=i+1;j<a;j++){
            if(jsz[i]>jsz[j]){
                e=jsz[i];
                jsz[i]=jsz[j];
                jsz[j]=e;
            }
        }
    }
    for(int i=0;i<a;i++){
        printf("%d",jsz[i]);
        if(i!=a-1){
            printf(",");
        }
    }
    return 0;
}
int main()
{
	int i,n,t,m;
	scanf("%d",&n);
	int sz1[1000],sz[1000];
	int s=0;
	for(i=0;i<n;i++)
	{
		scanf("%d",&sz1[i]);
		if(sz1[i]%2==1)
		{
			sz[s]=sz1[i];
		s++;
		}
	}
		for(i=0;i<s;i++)
	{
		for(m=0;m<s-i;m++)
			if(sz[m]>sz[m+1])
			{
				t=sz[m+1];
				sz[m+1]=sz[m];
				sz[m]=t;
			}
	}
	for(i=1;i<s;i++)
		printf("%d,",sz[i]);
	printf("%d",sz[s]);
	return 0;
}
//
//  Created by Chu-Pan,Wong on Nov 11, 2013.
//  Copyright (c) 2013 ChuPan,Wong. All rights reserved.
//



int main(int argc, char** argv){
    int n;
    int num[500];
    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-1]>num[j]){
    			int tmp = num[j-1];
    			num[j-1] = num[j];
    			num[j] = tmp;
    		}
    	}
    }
    int cnt = 0;
    for(int i=0;i<n;i++){
    	if(num[i]%2==1){
    		if(cnt!=0){
    			cout<<',';
    		}
    		cout<<num[i];
    		cnt++;
    	}
    }
    cout<<endl;
    return 0;
}
int main(){
int n;
scanf("%d",&n);
int a[501];
int i;
int c;
int j=0;
int m=0;
int k=1;
for(i=0;i<n-1;i++){
scanf("%d ",&a[i]);
}
scanf("%d",&a[n-1]);
int b[501];
for(i=0;i<n;i++){
if(a[i]%2!=0){
m=m+1;
}
}
for(i=0;i<n;i++){
	if(a[i]%2!=0){
	b[j]=a[i];
	j++;
	}
}
for(j=0;j<m-1;j++){
	for(i=0;i<m-k;i++){
		if(b[i]>b[i+1]){
		c=b[i];
		b[i]=b[i+1];
		b[i+1]=c;


		}
	}
	k++;
}
for(i=0;i<m-1;i++){
printf("%d,",b[i]);
}
printf("%d",b[m-1]);
return 0;
}
/*
 * shuzujishu.cpp
 *
 *  Created on: 2012-11-9
 *      Author: alias
 */
int main() {
	int n;
	cin >> n;
	/*
	 * ??a[n],??????????b[n]
	 *
	 */
	int a[n];
	for (int i = 0; i < n; i++)
		cin >> a[i];
	int b[n], m = 0;
	for (int j = 0; j < n; j++) {
		if (a[j] % 2 != 0) {
			b[m] = a[j];
			m++;
		}
	}
	/*
	 * ??????b???m?????
	 */
	int temp,k;
	for(int p=0;p<m-1;p++){
		for(k=0;k<m-1-p;k++){
			if(b[k]>b[k+1]){
				temp=b[k];
				b[k]=b[k+1];
				b[k+1]=temp;
			}
		}
	}
	/*
	 * ??b???m?
	 */
	for (int q = 0; q < m; q++) {
		if (q == 0)
			cout << b[q];
		else
			cout << "," << b[q];
	}
}
int main ()
{
	int n,i,j,k,l,a,c;
	a=0;
	int sz[500];
	int sc[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)
			a=a+1;
	}
	j=0;
	for (k=0;k<a;k++)                     
	{
		while (j<n)
		{
			if (sz[j]%2!=0)
				break;
			else
				j++;
		}
		sc[k]=sz[j];
		j++;
	}
	for (l=0;l<a;l++)
	{
		for (k=a-1;k>l+1;k--)
		{
			if (sc[k-1]>sc[k])
			{
				c=sc[k-1];
				sc[k-1]=sc[k];
				sc[k]=c;
			}
		}
	}
	for (l=0;l<a-1;l++)
		printf ("%d,",sc[l]);
	printf ("%d\n",sc[a-1]);
	return 0;
}
int main(){
	int n,input[501],i,p,ex;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d",&input[i]);
		if(input[i]%2==0){i--;n--;}}
	for(i=0;i<n;i++){
		for(p=0;p<n-1;p++){
			if(input[p]>input[p+1]){
				ex=input[p];
				input[p]=input[p+1];
				input[p+1]=ex;}}}
	printf("%d",input[0]);
	for(i=1;i<n;i++){printf(",%d",input[i]);}

	

	
return 0;
}
/*
 * Oddsingleincreasingsequence.cpp
 *
 *  Created on: 2012-11-18
 *      Author: ???
 */
int main() {
	int n, i, j = 0, temp, m;    //??int???
	cin >> n;                    //??n
	int a[n], b[n];              //????????
	for (i = 0; i < n; i++) {
		cin >> a[i];
	}                            //??????????
	for (i = 0; i < n; i++) {
		if (a[i] % 2 != 0) {
			b[j] = a[i];
			j++;
		} else
			continue;
	}                           //???????????????
	for (i = 0; i < j - 1; i++) {
		for (m = 0; m < j - i-1; m++)
			if (b[m] > b[m + 1]) {
				temp = b[m ];
				b[m] = b[m+1];
				b[m + 1] = temp;
			}
	}                           //???????????
	for (m = 0; m < j; m++) {
		if (m < j - 1)
			cout << b[m] << ",";
		else
			cout << b[m];        //???????
	}

}
int main(){
	int n,i,a,m=0,k,max;
	int s[500];
	int r[500]={0};
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d",&s[i]);
		if(s[i]%2!=0){
			r[i]=s[i];
		}
	}
	
	for(k=1;k<=n;k++){
		max=0;
		for(i=0;i<=n-k;i++){
			if(r[i]>=r[max]) max=i;
		}
		if(max!=n-k){
			a=r[max];
			r[max]=r[n-k];
			r[n-k]=a;
		}
	}
	
	for(i=0;i<n;i++){
		if(i==n-1) printf("%d",r[i]);
		else{if(r[i]!=0)
			printf("%d,",r[i]);}
	    	
	}

	return 0;

}
int main()
{int n,num,a[500]={0},i,j=0,k; //i,j,k????? 
 cin>>n;
 for(i=0;i<n;i++)
 {
  cin>>num;
  if(num%2==1)
    {a[j]=num;
     j++;}                //????????????? ?j??????? 
  } 
 for(i=0;i<j-1;i++)
  for(k=0;k<j-1-i;k++)
   if(a[k]>a[k+1])
   {num=a[k+1];
    a[k+1]=a[k];
    a[k]=num;}           //????? 
 for(i=0;i<j-1;i++)
  cout<<a[i]<<",";
 cout<<a[j-1];
 return 0;
}
int main()
{
	int N,n=0,num[500],i,j,number;
	scanf("%d",&N);
	for(i=1;i<=N;i++)
	{
		scanf("%d",&number);
		if(number%2!=0)
		{
			n=n+1;
			num[n-1]=number;
		}
	}
	for(i=1;i<n;i++)
	{
		for(j=0;j<n-i;j++)
		{
			if(num[j]>num[j+1])
			{
				number=num[j+1];
				num[j+1]=num[j];
				num[j]=number;
			}
		}
	}
	for(i=0;i<n;i++)
	{
		printf("%d",num[i]);
		if(i<n-1)
		{
			printf(",");
		}
	}
	printf("\n");
	return 0;
}
int main ()
{
    int n ;
    cin >> n ;
    int number[500] ;                       //?????? 
    
    for ( int i = 1 ; i <= n ; i++ )        //??
        cin >> number[i-1] ;
 
    for ( int i = 1 ; i <= n - 1 ; i++ )    //?????
        for ( int j = 1 ; j <= n - i ; j++ )
        {
            int change = 0 ;
            if ( number[j-1] > number[j] )
            {
                 change = number[j-1] ;
                 number[j-1] = number[j] ;
                 number[j] = change ;
            }
        }

    int sum = 0 ;                           //???????????????????
    for ( int i = 1 ; i <= n ; i++ )
        if ( number[i-1] % 2 == 1 )
           sum++ ;
    
    int rank = 0;                           //?????????????? 
    for ( int i = 1 ; i <= n ; i++ )        //?? 
        if ( number[i-1] % 2 == 1 )
        {
           rank++ ;                         //rank = ?????????? 
           if ( rank == sum )               //??????? 
           {
               cout << number[i-1] ;        //???? 
               break ;                      //????????? 
           }
           else                             //?????????? 
               cout << number[i-1] << "," ;
        }
    return 0 ; 
}
// ( > w < ) finished~
int main()
{
	int n,i,k=0,j=0,temp;
	int a[500]={0};
	scanf("%d\n",&n);
	for(i=0;i<n;i++)
	{
		scanf("%d",&a[i]);
	}
	for(i=1;i<n;i++)
	{
		for(j=0;j<n-i;j++)
		{
			if(a[j]>a[j+1])
			{
				temp=a[j+1];
				a[j+1]=a[j];
				a[j]=temp;
			}
		}
	}
	j=0;
	for(i=0;i<n;i++)
	{
		if(j==0&&a[i]%2==1)
		{
			printf("%d",a[i]);
			j=1;
		}
		else if(j!=0&&a[i]%2==1)
		{
			printf(",%d",a[i]);
		}
	}
	return(0);
}
int main(){
	int sz[500],n,i,k,s,d,c,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]){
			   s=sz[i+1];
			   sz[i+1]=sz[i];
			   sz[i]=s;
		   }
	   }
	   }
    for(c=0;c<n;c++){
		d=sz[c]%2;
		if(d==1){
		printf("%d",sz[c]);
		}
		break;
	}
    for(e=c+1;e<n;e++){
		d=sz[e]%2;
		if(d==1){
		printf(",%d",sz[e]);
		}
	}
	return 0;
}
int main()
{int n=0,i=0,k=0,j=0;
cin>>n;
int a[n];
for(i=0;i<n;i++)
{cin>>a[i];
}
for(i=0;i<n;i++)
{if(a[i]%2!=0)
a[k++]=a[i];
}
for(i=0;i<k;i++)
{for(j=i;j<k;j++)
{if(a[i]>a[j]) 
{n=a[i];
a[i]=a[j];
a[j]=n;
}
}
}
for(i=0;i<k;i++)
{cout<<a[i];
if(i!=k-1) cout<<",";
}
return 0;
}
int main()
{
	int N,a[501],i,m,j,b[501],p=1;//??????ab
	cin>>N;//??N
	for(i=1;i<=500;i++)//???ab??????-1
	{
		a[i]=-1;
		b[i]=-1;
	}
	for(i=1;i<=N;i++)//???????a?
	{
		cin>>a[i];
	}
	for(i=1;i<=N-1;i++)//???a??????????
	{
		for(j=1;j<=N-i;j++)
		{
			if(a[j]>a[j+1])
			{
				m=a[j];
				a[j]=a[j+1];
				a[j+1]=m;
			}

		}
	}
	for(i=1;i<=499;i++)//???a?????????b?
	{
		if(a[i]%2!=0&&a[i]!=-1)
		{
			b[p]=a[i];
			p=p+1;		
		}
	}
	for(i=1;i<=499;i++)//????????b????
	{
		if(b[i]!=-1&&b[i+1]!=-1)
		{
			cout<<b[i]<<",";
			m=i+1;
		}
	}
	cout<<b[m]<<endl;
	return 0;
}
int main()
{
	int n,a,b,c,d;
	int z[1000];
	int x[1000];
	scanf("%d",&n);
	for(a=0;a<=n-1;a++)
	{
		scanf("%d",&z[a]);
	}
	a=0;
	b=0;
    while(a<=n-1)
	{
        if(z[a]%2!=0) 
		{
		x[b]=z[a];
		b=b+1;
        }
		a=a+1;
	}
	for(a=0;a<=b-1;a++)
	{
		for(c=0;c<b-1-a;c++)
		{
			if(x[c]>x[c+1])
			{
				d=x[c];
				x[c]=x[c+1];
				x[c+1]=d;
			}
		}
	}
	for(a=0;a<=b-1;a++)
	{
		if (a<=b-2)
		printf("%d,",x[a]);
		else printf("%d",x[a]);
	}
	return 0;
}
int main(){
	int n,i,j,k,v,t;
	int a[500];
	int b[500];
	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=j+1;
		}
		else
			continue;
	}
	for(v=0;v<j;v++){
		for(k=v+1;k<j;k++){
			if(b[v]>b[k]){
				t=b[v];
				b[v]=b[k];
				b[k]=t;
			}
		}
	}
	for(v=0;v<j;v++){
		printf("%d",b[v]);
		if(v<j-1)
			printf(",");
	}
	return 0;
}
int main()
{
	int N,m,n,t,i,k;
	scanf("%d",&N);
	int b[500];
	int a[500];
	for(i=0;i<N;i++)
	{
		scanf("%d",&b[i]);
	}
	n=0;
	for(i=0;i<N;i++)
	{
		if(b[i]%2==1)
			n++;
	}
	k=0;
	for(i=0;i<N;i++)
	{
		if(b[i]%2==1)
		{
			a[k]=b[i];
			k++;
		}
	}
	for(m=0;m<n;m++)
	{
		for(i=m;i<n;i++)
		{	
			if(a[m]>a[i])
			{
				t=a[m];
				a[m]=a[i];
				a[i]=t;
			}
		}
	}
	for(i=0;i<n-1;i++)
	{
		printf("%d,",a[i]);
	}
	printf("%d",a[n-1]);
	return 0;
}
int main()
{
int i,j,t,n,m=0,a[500],b[500];
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[m]=a[i];
m++;
}
for(j=0;j<m-1;j++)
for(i=0;i<m-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<m;i++)
{
printf("%d",b[i]);
if(i!=m-1)
printf(",");
}
return 0;
}
int main()
{
char s1[80],s2[80];
int n,m,s,a,b;
gets(s1);
gets(s2);
for(n=0,m=0;s1[n]!='\0';n++)
{
	a=n;
if(s1[n]==s2[n]||s1[n]-s2[n]==32||s1[n]-s2[n]==-32)m++,b=m;
if((s1[n]>s2[n]&&s1[n]-s2[n]>32)||(s1[n]<s2[n]&&s1[n]-s2[n]>-32))
{
	printf(">");
	break;
}
if((s1[n]>s2[n]&&s1[n]-s2[n]<32)||(s1[n]<s2[n]&&s1[n]-s2[n]<-32))
{
	printf("<");
	break;
}
}
if(a==b-1)printf("=");
return 0;
}
char change(char s)
{
	if(s>='A'&&s<='Z')
		s=s-'A'+'a';
	return s;
}

int main()
{
	char c[2][80];
	int i,j;
	for(j=0;j<2;j++)
		gets(c[j]);
	for(j=0;j<2;j++)
	for(i=0;c[j][i]!='\0';i++)
	{
		c[j][i]=change(c[j][i]);
	}
	if(strcmp(c[0],c[1])>0) printf(">");
	else if(strcmp(c[0],c[1])<0) printf("<");
	else printf("=");
}
int main(int argc, char* argv[])
{
	char a[80],b[80];
	gets(a);
	gets(b);
	int i,m=0;
	for(i=0;a[i]!='\0';i++)
	{
		if(a[i]>=65&&a[i]<=90&&b[i]>=65&&b[i]<=90||a[i]>=97&&a[i]<=122&b[i]>=97&&b[i]<=122)
		{
			if(a[i]>b[i])
			{
				m=1;
				break;
			}
			if(a[i]<b[i])
			{
				m=2;
				break;
			}
		}
		if(a[i]>96&&b[i]<96)
		{
			if(a[i]-32<b[i])
			{
				m=2;
				break;
			}
			if(a[i]-32>b[i])
			{
				m=1;
				break;
			}
		}
		if(b[i]>96&&a[i]<96)
		{
			if(b[i]-32<a[i])
			{
				m=1;
				break;
			}
			if(b[i]-32>a[i])
			{
				m=2;
				break;
			}
		}
	}
	if(m==0)
		printf("=");
	if(m==1)
		printf(">");
	if(m==2)
		printf("<");
	return 0;
}
int main()
{
	int i,s;
	char a[256],b[256];
	gets(a);
	gets(b);
	for(i=0;i<strlen(a);i++)
		if(a[i]>96)a[i]-=32;
	for(i=0;i<strlen(b);i++)
		if(b[i]>96)b[i]-=32;
	s=strcmp(a,b);
	if(s<0)cout<<'<';
	if(s>0)cout<<'>';
	if(s==0)cout<<'=';
	return 0;
}
void main()
{
   int i,a,b;
//==========??????????????===========
//   char ch1[10][80],ch2[10][80],max1[80],max2[80];
//   gets(ch1[0]);   
//   for(i=0;i<80;i++)
//   { if(ch1[i]!='\0')
//       gets(ch1[i]);
//   }
//   a=strlen(ch1);
//   gets(ch2[0]);
//   for(i=0;i<80;i++)
//   {   if(ch2[i]!='\0')
//       gets(ch2[i]);
//   }
//   b=strlen(ch2);
//   strcpy(max,ch[0]);
//======================================================
     char ch1[80],ch2[80];          // ????????
     gets(ch1);
     a=strlen(ch1);
     gets(ch2);
     b=strlen(ch2);
//====????????????????????????===
     for(i=0;i<a;i++) if(ch1[i]>='A'&& ch1[i]<='Z') ch1[i]=(ch1[i]+32);
     for(i=0;i<b;i++) if(ch2[i]>='A'&& ch2[i]<='Z') ch2[i]=(ch2[i]+32);
     if (strcmp(ch1,ch2)>0) printf("%c",'>'); 
     if (strcmp(ch1,ch2)<0) printf("%c",'<');
     if (strcmp(ch1,ch2)==0) printf("%c",'=');	  
}
int main()
{
	char str1[80],str2[80],i;
	cin.getline(str1,80);
	cin.getline(str2,80);
	for(i=0;i<80;i++){
		if(str1[i]>=97&&str1[i]<=122)
			str1[i]-=32;
		if(str2[i]>=97&&str2[i]<=122)
			str2[i]-=32;
	}
	if(strcmp(str1,str2)==0)
		cout<<"="<<endl;
	if(strcmp(str1,str2)==1)
		cout<<">"<<endl;
	if(strcmp(str1,str2)==-1)
		cout<<"<"<<endl;
return 0;
}
int main(int argc, char* argv[])
{
	char a[80],b[80];
	gets(a);
	gets(b);
	int l;
	l=strlen(a);
	int i;
	for(i=0;a[i]!='\0';i++){
		if(a[i]>='A'&&a[i]<='Z') a[i]+=32;
	}
	for(i=0;b[i]!='\0';i++){
		if(b[i]>='A'&&b[i]<='Z') b[i]+=32;
	}
	int t;t=0;
	for(i=0;a[i]!='\0';i++){
		if(a[i]>b[i]){
			printf(">");
			break;
		}
		else if(a[i]<b[i]){
			printf("<");
			break;
		}
		else if(a[i]==b[i]) t++;
	}
	if(t==l) printf("=");
	return 0;
}
int main()
{
	char a[80],b[80];
	int i;
	gets(a);
	gets(b);
	for(i=0;a[i]!=0;i++)
		if(a[i]>=65&&a[i]<=90)a[i]+=32;
	for(i=0;b[i]!=0;i++)
		if(b[i]>=65&&b[i]<=90)b[i]+=32;
	i=strcmp(a,b);
	if(i>0)printf(">");
	else if(i==0)printf("=");
	else printf("<");
	return 0;
}
void main()
{
	char str1[1000],str2[1000];
	int i,j,k;
	gets(str1);
	gets(str2);
	for(i=0;i<1000;i++)
	{
			if(str1[i]>64&&str1[i]<91)/*????????*/
			{str1[i]=str1[i]+32;}
			if(str2[i]>64&&str2[i]<91)
			{str2[i]=str2[i]+32;}
	}
    for(i=0;i<1000;i++)
	{
	if(str1[i]=='\0'&&str2[i]=='\0')
	{printf("=");break;}
	if(str1[i]>str2[i])
	{printf(">");break;}
    if(str1[i]<str2[i])
	{printf("<");break;}
	}
}
int main()
{
	char s1[81],s2[81];
	int i;
	gets(s1);
	gets(s2);
	for(i=0;;i++)
	{
		if(s1[i]>=97&&s1[i]<=122)s1[i]=s1[i]-32;
		if(s2[i]>=97&&s2[i]<=122)s2[i]=s2[i]-32;
		if(s1[i]>s2[i]){printf(">\n");break;}
		else if(s1[i]<s2[i]){printf("<\n");break;}
		else if(s1[i]==0&&s1[i]==s2[i]){printf("=\n");break;}
	}
	return 0;
}
int main()
{
	char a[80],b[80];
	int i;
	gets(a);
	gets(b);
	for(i=0;a[i];i++)
	{if(a[i]=='a')
	a[i]='A';
	if(a[i]=='b')
	a[i]='B';
	if(a[i]=='c')
	a[i]='C';
	if(a[i]=='d')
	a[i]='D';
	if(a[i]=='e')
	a[i]='E';
	if(a[i]=='f')
	a[i]='F';
	if(a[i]=='g')
	a[i]='G';
	if(a[i]=='h')
	a[i]='H';
	if(a[i]=='i')
	a[i]='I';
	if(a[i]=='j')
	a[i]='J';
	if(a[i]=='k')
	a[i]='K';
	if(a[i]=='l')
	a[i]='L';
	if(a[i]=='m')
	a[i]='M';
	if(a[i]=='n')
	a[i]='N';
	if(a[i]=='o')
	a[i]='O';
	if(a[i]=='p')
	a[i]='P';
	if(a[i]=='q')
	a[i]='Q';
	if(a[i]=='r')
	a[i]='R';
	if(a[i]=='s')
	a[i]='S';
	if(a[i]=='t')
	a[i]='T';
	if(a[i]=='u')
	a[i]='U';
	if(a[i]=='v')
	a[i]='V';
	if(a[i]=='w')
	a[i]='W';
	if(a[i]=='x')
	a[i]='X';
	if(a[i]=='y')
	a[i]='Y';
	if(a[i]=='z')
		a[i]='Z';}
	for(i=0;b[i];i++)
	{if(b[i]=='a')
	b[i]='A';
	if(b[i]=='b')
	b[i]='B';
	if(b[i]=='c')
	b[i]='C';
	if(b[i]=='d')
	b[i]='D';
	if(b[i]=='e')
	b[i]='E';
	if(b[i]=='f')
	b[i]='F';
	if(b[i]=='g')
	b[i]='G';
	if(b[i]=='h')
	b[i]='H';
	if(b[i]=='i')
	b[i]='I';
	if(b[i]=='j')
	b[i]='J';
	if(b[i]=='k')
	b[i]='K';
	if(b[i]=='l')
	b[i]='L';
	if(b[i]=='m')
	b[i]='M';
	if(b[i]=='n')
	b[i]='N';
	if(b[i]=='o')
	b[i]='O';
	if(b[i]=='p')
	b[i]='P';
	if(b[i]=='q')
	b[i]='Q';
	if(b[i]=='r')
	b[i]='R';
	if(b[i]=='s')
	b[i]='S';
	if(b[i]=='t')
	b[i]='T';
	if(b[i]=='u')
	b[i]='U';
	if(b[i]=='v')
	b[i]='V';
	if(b[i]=='w')
	b[i]='W';
	if(b[i]=='x')
	b[i]='X';
	if(b[i]=='y')
	b[i]='Y';
	if(b[i]=='z')
		b[i]='Z';}
	for(i=0;i<80;i++)
	{
		if(a[i]<b[i])
		{
			printf("<");
			break;
		}
		else if(a[i]>b[i])
		{
			printf(">");
			break;
		}
		else if(a[i]=='\0')
		{
			printf("=");
			break;
		}
			
	}
	
	return 0;
}
int cmp(char* a,char* b)
{
	int ai=0,bi=0;
	while(a[ai]!=0&&b[bi]!=0)
	{
		if(a[ai]>b[bi])
			return 1;
		if(a[ai]<b[bi])
			return -1;
		ai++;
		bi++;
	}
	if(a[ai]!=0)
		return 1;
	if(b[bi]!=0)
		return -1;
	return 0;
}

void strlw(char *a)
{
	int i=0;
	while(a[i]!=0)
	{
		if(a[i]>='A'&&a[i]<='Z')
			a[i]+=('a'-'A');
		i++;
	}
}
int main()
{
	char a[1000];
	char b[1000];
	cin.getline(a,900,'\n');
	cin.getline(b,900,'\n');
	strlw(a);
	strlw(b);
	switch(cmp(a,b))
	{
	case 0:
		cout<<'='<<endl;
		break;
	case 1:
		cout<<'>'<<endl;
		break;
	case -1:
		cout<<'<'<<endl;
		break;
	}
	return 0;
}
int main(){
char p[100];
char q[100];
gets(p);
gets(q);
int m,n;
m=strlen(p);
n=strlen(q);
for(int i=0;i<m;i++)
{if(p[i]>=97&&p[i]<=122)
p[i]=p[i]-32;}
for(int k=0;k<n;k++)
{if(q[k]>=97&&q[k]<=122)
q[k]=q[k]-32;}
int t;
t=strcmp(p,q);
if(t==0)
printf("=");
else if(t>0)
printf(">");
else
printf("<");
return 0;
}
int main()
{
	int i, j, k;
	char a[81], b[81];
gets(a);
gets(b);
for(i=0;a[i];i++)
{
	if(a[i]>='A'&&a[i]<='Z')
	{
		a[i]=a[i]-'A'+'a';
	}
}
for(i=0;b[i];i++)
{

	if(b[i]>='A'&&b[i]<='Z')
	{
		b[i]=b[i]-'A'+'a';
	}
}

k=strcmp(a,b);
if(k>0)
{
	printf(">");
}
else if(k<0)
{

	printf("<");
}
else
{
	printf("=");

}
return 0;
}
int main()
{
	int i,n,m;
	char c[100],d[100];
	gets(c);
	gets(d);
	m=strlen(c);
	n=strlen(d);
	for(i=0;i<m;i++)
	{
		if((c[i]>='A')&&(c[i]<='Z'))
		{
			c[i]=c[i]+32;
		}
	}
	for(i=0;i<n;i++)
	{
		if((d[i]>='A')&&(d[i]<='Z'))
		{
			d[i]=d[i]+32;
		}
	}
	if(strcmp(c,d)>0) printf(">");
	else if(strcmp(c,d)<0) printf("<");
	else printf("=");
	return 0;
}