void main()
{
	int a,b,c,u;

	scanf("%d",&u);
	a=u%3;
	b=u%5;
	c=u%7;

	if (a>0)
	{
		if (b>0)
			if (c>0) printf("n");
			else printf("7");
		else
			if (c>0) printf("5");
			else printf("5 7");
	}
	else
	{
		if (b>0)
			if (c>0) printf("3");
			else printf("3 7");
		else
			if (c>0) printf("3 5");
			else printf("3 5 7");
	}

}


int main()
{
    int n;
    scanf("%d",&n);
    int r3 = 0, r5 = 0, r7 = 0;
    if (n%3!=0) r3 = 1;
    if (n%5!=0) r5 = 1;
    if (n%7!=0) r7 = 1;
    int temp = r3*4 + r5*2 +r7;
    switch (temp)
    {
        case 7 :
             printf("n\n");
             break;
        case 1 :
             printf("3 5\n");
             break;
        case 2 :
             printf("3 7\n");
             break;
        case 4 :
             printf("5 7\n");
             break;
        case 6 :
             printf("7\n");
             break;
        case 5 :
             printf("5\n");
             break;
        case 3 :
             printf("3\n");
             break;
        case 0 :
             printf("3 5 7\n");
             break;
    }
    getchar();
    getchar();
    return 0;
}


int main ()
{
	int a,i,m,e,f;
	m=0;
	scanf("%d",&a);
	for(i=3;i<8;i=i+2)
	{
		if (a%i==0)
		{	m=m+1;
		  if (m==1)
		  e=i;
		  else
			f=i;
		}

	}
	switch (m){
	case 0:
		printf("n");break;
	case 1:
		printf("%d",e);break;
	case 2:
        printf("%d %d",e,f);break;
	case 3:
		printf("3 5 7");break;
	}
	return 0;
}


int main(int argc, char *argv[])
{
  int n,m=0;
  scanf("%d",&n);
  if(n%7==0)
      m++;
  if(n%5==0)
      m+=10;
  if(n%3==0)
      m+=100;
  switch(m)
  {
      case 111: printf("3 5 7");break;
      case 11: printf("5 7");break;
      case 101: printf("3 7");break;
      case 110: printf("3 5");break;
      case 100: printf("3");break;
      case 10: printf("5");break;
      case 1: printf("7");break;
      case 0: printf("n");
  }

  return 0;
}


//
//  main.cpp
//  hw
//
//  Created by ? ? on 12-12-16.
//  Copyright (c) 2012? ? ?. All rights reserved.
//

int main(int argc, const char * argv[])
{
    int x,a[3]={3,5,7};
    cin>>x;
    int k;
    for (k=0; k<3; k++) {
        if (x%a[k]==0) {
            cout<<a[k];
            break;
        }
    }
    if (k==3) {
        cout<<"n";
        return 0;
    }
    for (int i=k+1; i<3; i++) {
        if (x%a[i]==0) {
            cout<<" "<<a[i];
        }
    }

    return 0;
}


int main()
{int a,b,c,d;
scanf("%d",&d);
a=d%3;
b=d%5;
c=d%7;
if (!a)
{ if (!b)
{    if (!c)
         printf("3 5 7");
      else
		  printf("3 5");}
   else
   { if (!c)
      printf ("3 7");
   else
	   printf("3");}}
else
{  if (!b)
   {  if (!c)
        printf("5 7");
       else
		   printf("5");}
   else
   {  if (!c)
        printf("7");
       else
		   printf("n");}}
return 0;
}


int main()
{
	int num, k = 0;
	cin >> num;
	if(num % 3 == 0)
		cout << "3";
	else
		k++;
	if(num % 5 == 0)
	{
		if(k == 1)
			cout << "5";
		else
			cout << " 5";
	}
	else
		k++;
	if(num % 7 == 0)
	{
		if(k == 2)
			cout << "7";
		else
			cout << " 7";
	}
	else
		k++;
	if(k == 3)
		cout << "n" << endl;
	else
		cout << "\n";
	return 0;
}


int main (void)
{
	int num = 0;
	cin >> num;

	if (!(num % 105))
		cout << "3 5 7" << endl;
	else if (!(num % 35))
		cout << "5 7"<< endl;
	else if (!(num % 21))
		cout <<"3 7"<<endl;
	else if (!(num % 15))
		cout << "3 5"<<endl;
	else if (!(num % 7))
		cout << '7'<<endl;
	else if (!(num % 5))
		cout << '5'<<endl;
	else if (!(num % 3))
		cout << '3'<<endl;
	else
		cout <<'n'<<endl;

	return 0;
}


int main(){
	int num, leap_1=0 , leap_2=0 ,leap_3=0;
	scanf("%d", &num);
	if (num%3== 0){
		leap_1=1;
	}
    if (num%5== 0){
		leap_2=1;
	}
    if (num%7== 0){
		leap_3=1;
	}
	if (leap_1 * leap_2 * leap_3 == 1){
		printf("3 5 7");
	}
	else if (leap_1 * leap_2 == 1){
		printf("3 5");
	}
	else if (leap_1 * leap_3 == 1){
		printf("3 7");
	}
	else if (leap_2 * leap_3 == 1){
		printf("5 7");
	}
	else if (leap_1 == 1){
		printf("3");
	}
	else if (leap_2 == 1){
		printf("5");
	}
	else if (leap_3 == 1){
		printf("7");
	}
	else {
		printf("n");
	}
	return 0;
}


int main()
{
int x,sum=0;
cin>>x;
if(x%3==0)
sum=sum+3;
if(x%5==0)
sum=sum+5;
if(x%7==0)
sum=sum+7;
switch(sum)
{
case 15:cout<<"3 "<<"5 "<<"7"<<endl;break;
case 8:cout<<"3 "<<"5"<<endl;break;
case 10:cout<<"3 "<<"7"<<endl;break;
case 12:cout<<"5 "<<"7"<<endl;break;
case 3:cout<<"3"<<endl;break;
case 5:cout<<"5"<<endl;break;
case 7:cout<<"7"<<endl;break;
default:cout<<"n"<<endl;break;
}
return 0;
}


int main()
{
	int a,b,c,d,e,f,g,h;
	scanf("%d",&a);
    b=a%3;
    c=a%5;
    d=a%7;
    e=a%15;
    f=a%21;
    g=a%35;
    h=a%105;
    if(h==0)
    printf("3 5 7\n");
    else if(e==0)
    printf("3 5\n");
    else if(f==0)
    printf("3 7\n");
    else if(g==0)
    printf("5 7\n");
    else if(b==0)
    printf("3\n");
    else if(c==0)
    printf("5\n");
    else if(d==0)
    printf("7\n");
    else printf("n");
	return 0;
}


int main()
{
	int a,b,c,i;
	scanf("%d",&i);
	a=i%3==0;
	b=i%5==0;
	c=i%7==0;
	if(a+b+c==3) printf("3 5 7\n");
	else if(a+b==2) printf("3 5\n");
	else if(a+c==2) printf("3 7\n");
	else if(b+c==2) printf("5 7\n");
	else if(a==1) printf("3\n");
	else if(b==1) printf("5\n");
	else if(c==1) printf("7\n");
	else printf("n\n");
	return 0;
}


int max(int a,int b){
	if(a>b) return a;
	else return b;
}
int min(int a,int b){
    if(a>b) return b;
	else return a;
}
int main(){
	int n,count=0,i=0,a[3]={0,0,0};
	scanf("%d",&n);
	if(n%3==0){
		count++;a[count-1]=3;i=3;}
	if(n%5==0){
		count++;a[count-1]=5;i=5;}
	if(n%7==0){
		count++;a[count-1]=7;i=7;}
	if(count==0)
		printf("n");
	if(count==1)
		printf("%d",i);
	if(count==2)
		printf("%d %d",min(a[0],a[1]),max(a[0],a[1]));
	if(count==3)
		printf("3 5 7");
	return 0;
}


int main()
{
	int three(int x);
	int five(int x);
	int seven(int x);
	int print(int a,int b,int c);
	int a,b,c,x;
	scanf("%d",&x);
	a=three(x);
	b=five(x);
	c=seven(x);
	print(a,b,c);
	return 0;
}
int three(int x){
	int d;
	d=(x%3==0)?1:0;
	return d;
}
int five(int x){
	int d;
	d=(x%5==0)?1:0;
	return d;
}
int seven(int x){
	int d;
	d=(x%7==0)?1:0;
	return d;
}
int print(int a,int b,int c){
	if(a==1){
		printf("3");
		if(b==1||c==1){
			printf(" ");
		}
	}
	if(b==1){
		printf("5");
		if(c==1){
			printf(" ");
		}
	}
	if(c==1){
		printf("7");
	}
	if(a==0&&b==0&&c==0){
		printf("n");
	}
	return 0;
}


int main()
{
    int aaa=0;

    int num ;

    cin >> num ;

    if (num % 3 == 0 )
    {
            cout << 3 ;
            aaa=3;
    }
    if (num % 5 == 0 )
    {
            if(aaa!=0)
                cout << " " ;
            cout << 5 ;
            aaa=5;
    }
    if (num % 7 == 0 )
    {
            if(aaa!=0)
                cout << " " ;
            cout << 7;
            aaa=7;
    }

   if(aaa == 0)
        cout << "n" << endl ;

    return 0 ;
}


int main(){
	int sz[3]={3,5,7};
	int n;
	scanf("%d",&n);
	int i;
	int flag=0;
	int isfirsttime=1;

	for(i=0;i<3;i++){
			if(n%sz[i]==0){
				if(!isfirsttime){
				printf(" %d",sz[i]);
				flag=1;
				}else{
					printf("%d",sz[i]);
					flag=1;
					isfirsttime=0;

				}

			}

	}
	if(flag==0){
		printf("n");
	}
	return 0;
}


//
//  main.cpp
//  ds
//
//  Created by Love on 12-12-27.
//  Copyright (c) 2012? Love. All rights reserved.
//

int main(){
    int num,i=1;
    scanf("%d",&num);
    if (num%3==0) {
        printf("3");
        i=0;
    }
    if (num%5==0) {
        if (i==0) {
            printf(" ");
        }
        printf("5");
        i=0;
    }
    if (num%7==0) {
        if (i==0) {
            printf(" ");
        }

        printf("7");
        i=0;
    }
    if (i==1) {
        printf("n");
    }    return 0;

}


void main ()
{
	float n;
	int help,j,a,b;
	float x,i;
	j=2;
	a=0;b=1;

	scanf("%f",&n);

	for(i=3;i<8;i=i+2)
	{
		x=n/i;
		help=n/i;
		if (x==help) a=a+b;
		j=j+2;
		b=b*2;
		//printf("%d %f %d\n",a,x,help);
	}

	switch(a)
	{
	 case 0:printf("n");break;
	 case 1:printf("3");break;
	 case 2:printf("5");break;
	 case 3:printf("3 5");break;
	 case 4:printf("7");break;
     case 5:printf("3 7");break;
	 case 6:printf("5 7");break;
	 case 7:printf("3 5 7");break;
	 default:;
	}
}


int main()
{
int n;
cin>>n;
char a='n';
for (int i=3;i<=7;i+=2)
{
if (n%i==0)
{
if (a=='n') cout<<i;
else cout<<' '<<i;
a='\n';
}
}
cout<<a;
return 0;
}


void main()
{
	int a=3,b=5,c=7,d;
	scanf("%d",&d);
	if(d%(a*b*c)==0) printf("%d %d %d",a,b,c);
	else if(d%(a*b)==0) printf("%d %d",a,b);
	else if(d%(a*c)==0) printf("%d %d",a,c);
	else if(d%(b*c)==0) printf("%d %d",b,c);
	else if(d%a==0) printf("%d",a);
	else if(d%b==0) printf("%d",b);
	else if(d%c==0) printf("%d",c);
	else printf("n");
}


int main()
{
	int mm[3] = {3, 5, 7};
	int flag[3] = {0};
	int n;
	scanf("%d", &n);
	int i;
	for (i = 0; i < 3; i++)
	{
		if (n % mm[i] == 0)
			flag[i] = 1;
	}
	int space = -1;
	for (i = 0; i < 3; i++)
	{
		if (flag[i] == 1)
		{
			space ++;
			if (space == 0)
				printf("%d", mm[i]);
			else
				printf(" %d", mm[i]);
		}
	}
	if(space == -1)
		printf("n");
	printf("\n");
}


int flag,n;
void main()
{
	scanf("%d",&n);
	flag=0;
	if (n%3==0)
	{printf("3");flag=1;}
	if (n%5==0)
	{
		if (flag==0)
		{printf("5");flag=1;}
		else
			printf(" 5");
	}
	if (n%7==0)
	{
		if (flag==0)
		{printf("7");flag=1;}
		else
			printf(" 7");
	}
	if (flag==0) printf("n");
	printf("\n");
}


int main(int argc, char* argv[])
{
	int n;
	scanf("%d",&n);
	if(n%3==0){
		if(n%5==0){
			if(n%7==0)
				printf("3 5 7");
			else printf("3 5");}
		else {
			if(n%7==0)
				printf("3 7");
			else printf("3");}
	}
	else{
		if(n%5==0){
			if(n%7==0)
				printf("5 7");
			else printf("5");}
		else {
			if(n%7==0)
				printf("7");
			else printf("n");}
	}
	return 0;
}


int main()
{
	int t,a=3,b=5,c=7;
	scanf("%d",&t);
	if(t%a==0&&t%b==0&&t%c==0)
		printf("%d %d %d",a,b,c);
	else if(t%a==0&&t%b==0)
		printf("%d %d",a,b);
	else if(t%a==0&&t%c==0)
		printf("%d %d",a,c);
	else if(t%b==0&&t%c==0)
		printf("%d %d",b,c);
	else if(t%a==0)
		printf("%d",a);
	else if(t%b==0)
		printf("%d",b);
	else if(t%c==0)
		printf("%d",c);
	else
		printf("n");
	return 0;
}


int main(){
	int a,b,c,d;
	int w=3;
	int z=5;
	int x=7;
	scanf("%d",&a);
	b=a%3;
	c=a%5;
	d=a%7;
	if (b==0&&c==0&&d==0)
		printf("%d %d %d",w,z,x);
	else if(b==0&&c==0)
		printf("%d %d",w,z);
	else if(b==0&&d==0)
		printf("%d %d",w,x);
	else if(c==0&&d==0)
		printf("%d %d",z,x);
	      else if(b==0)
			  printf("%d",w);
		       else if(c==0)
				   printf("%d",z);
			        else if(d==0)
						printf("%d",x);
					      else printf("n");
	 return 0;

}


int main()
{
	int n;
	cin >> n;
	int sum = 0;
	for(int i = 3; i <= 7; i = i+2)
	{
            if((n%i) == 0)
            sum = sum + 1;
    }
    int t = 0;
    for(int i = 3; i <= 7; i = i+2)
	{
            if((n%i) == 0)
            {
             t = t + 1;
               if(t < sum) cout << i <<" ";
               else  cout << i ;
            }
    }
    if(sum == 0) cout << 'n';
	//while(1);
	return 0;
}


void print(int, int);
int flag;

int main()
{
    int a3 = 0, a5 = 0, a7 = 0;
    int n;

    scanf("%d", &n);
    a3 = (n%3)==0?1:0;
    a5 = (n%5)==0?1:0;
    a7 = (n%7)==0?1:0;

    if (a3+a5+a7 == 0) {
        printf("n");
        return 0;
    }

    print(a3, 3);
    print(a5, 5);
    print(a7, 7);

    return 0;
}

void print(int a, int num)
{
    if (a) {
        if (flag)
            printf(" %d", num);
        else
            printf("%d", num);
        flag = 1;
    }
}


main()
{
	int a,b,c,d;
	    a=3;
		b=5;
		c=7;
	scanf("%d",&d);
	if(d%a==0)
	 if(d%b==0)
	  if(d%c==0)
	  printf("%d %d %d",a,b,c);
	  else printf("%d %d",a,b);
	else
		if(d%c==0)
			printf("%d %d",a,c);
         else
			 printf("%d",a);
	else
		if(d%b==0)
			if(d%c==0)
				printf("%d %d",b,c);
			else printf("%d",b);
		else
			if(d%c==0)
				printf("%d",c);
            else printf("n");
}


int main() {
	int number;
	int divisors[] = {3, 5, 7};
	int flag;

	cin >> number;
	flag = 0;

	for (int i=0; i<3; i++) {
		if (number % divisors[i] == 0) {
			if (flag == 1)
				cout << ' ';
			cout << divisors[i];
			flag = 1;
		}
	}
	if (flag == 0)
		cout << 'n';

	cout << endl;

	return 0;
}


int main ()
{
	int a;
	cin>>a;
	if (a%105==0)
		cout<<"3 5 7"<<endl;
	else if (a%15==0)
			cout<<"3 5"<<endl;
	else if (a%35==0)
			cout<<"5 7"<<endl;
	else if	(a%21==0)
			cout<<"3 7"<<endl;

	else if	(a%3==0)
			cout<<'3'<<endl;
	else if	 (a%5==0)
			cout<<'5'<<endl;
	else if	 (a%7==0)
			cout<<'7'<<endl;
	 else
		cout<<'n'<<endl;

	 return 0;

}


int main()
{
	int a,b,c,d,e,f,g,x,h,i,j,k,l,m,n,s;
	scanf("%d",&x);
	a=3;
	b=5;
	c=7;
	d=a*b*c;
	e=a*b;
	f=a*c;
	g=b*c;
	h=x%d;
	i=x%e;
	j=x%f;
	k=x%g;
	l=x%a;
	m=x%b;
	n=x%c;
	s=l*m*n;
	if(h==0)	printf("%d %d %d",a,b,c);
	else if(i==0)	printf("%d %d",a,b);
		 else if(j==0)	printf("%d %d",a,c);
              else if(k==0)	printf("%d %d",b,c);
			       else if(l==0)	printf("%d",a);
				   else if(m==0)	printf("%d",b);
				   else if(n==0)	printf("%d",c);

			       else

	printf("n");

}


int main()
{
	int iNumber,i,iCount_can=0,iCount_blank_space=0;//iNumber???????iCount_can????????????????iCount_blank_space????????????
	cin>>iNumber;
	for(i=3;i<8;i++,i++)
	{
		if(iNumber%i==0)                            //???????i??
		{
			if(iCount_blank_space)
				cout<<' ';
			cout<<i;
			iCount_can++;
			iCount_blank_space=1;                   //????????i?????iCount_blank_space=1??????????????????
		}
	}
	if(iCount_can==0)
		cout<<'n'<<endl;
    return 0;
}


int main()
{
	int a,b,c,d;
	scanf("%d",&a);
	b=a%3;
	c=a%5;
	d=a%7;
	if (b==0)
		if (c==0)
			if(d==0)
				printf("3 5 7");
			else
				printf("3 5");
		else
			if (d==0)
				printf("3 7");
			else
				printf("3");
	else
		if (c==0)
			if (d==0)
				printf("5 7");
			else
				printf("5");
		else
			if (d==0)
				printf("7");
			else
				printf("n");
	return 0;
}


int main()
{
	int n,flag=0;
	scanf("%d",&n);
	if(n%3==0)
	{
		printf("3");
		flag=1;
	}
	if(n%5==0)
	{
		if(flag)
			printf(" ");
		printf("5");
		flag=1;
	}
	if(n%7==0)
	{
		if(flag)
			printf(" ");
		printf("7");
		flag=1;
	}
	if(flag==0)
		printf("n");
	return 0;
}


int main()
{
	int a[4],m,i,j,b;
	scanf("%d",&m);
	for(i=3,b=0,j=1;j<=3;j++)
	{
		a[j]=m%i;
		if(a[j]==0)
		b=b+i;
		i=i+2;
	}
	switch(b)
	{
	case 0:printf("n");break;
	case 3:printf("3");break;
	case 5:printf("5");break;
	case 7:printf("7");break;
	case 8:printf("3 5");break;
	case 10:printf("3 7");break;
	case 12:printf("5 7");break;
	case 15:printf("3 5 7");break;
	}
	return 0;
}


void main()
{
	int a,b,c,d,e=3,f=5,g=7;
	char c1;
	scanf("%d",&a);
	b=a%3;c=a%5;d=a%7;
	c1='n';
	if (b==0)
		if (c==0)
		{
			if (d==0)
				printf("%d %d %d\n",e,f,g);
			else
				printf("%d %d\n",e,f);
		}
		else
		{
			if (d==0)
				printf("%d %d\n",e,g);
			else
				printf("%d\n",e);
		}
	else
		if (c==0)
		{
			if (d==0)
				printf("%d %d\n",f,g);
			else
				printf("%d\n",f);
		}

        else
		{
			if (d==0)
				printf("%d\n",g);
			else
				printf("%c\n",c1);
		}
}


int main(void)
{
	int a,three,five,seven,sum;
	scanf("%d",&a);
	three=(a%3==0);
	five=(a%5==0);
	seven=(a%7==0);
	sum=three+five+seven;
	if (sum==3)
		printf("3 5 7");
	if (sum==2)
		if (three==1)
		{
			printf("3");
			if (five==1)
				printf(" 5");
			else printf(" 7");
		}
		else printf("5 7");
	if (sum==1)
		if (three==1)
			printf("3");
		else if (five==1)
			printf("5");
		else printf("7");
	if (sum==0)
		printf("n");
}


void main()
{
	int a,b,c,d;char n;
	b=3;
	c=5;
	d=7;n='n';
	scanf("%d",&a);
	if(a%b==0)
	{
		if(a%c==0)
		{
			if(a%d==0)
			{
				printf("%d %d %d",b,c,d);
			}
			else
				printf("%d %d",b,c);
		}
		else
		{
			if(a%d==0)
			{
				printf("%d %d",b,d);
			}
			else
				printf("%d",b);
		}
	}
	else
	{
        if(a%c==0)
		{
			if(a%d==0)
			{
				printf("%d %d",c,d);
			}
			else
				printf("%d",c);
		}
		else
		{
			if(a%d==0)
			{
				printf("%d",d);
			}
			else
				printf("%c",n);
		}
	}
	return 0;
}


int oper;
void p(int n);
int main()
{
	int num;
	scanf("%d", &num);
	oper = 0;

	if(num%3 == 0)
		p(3);
	if(num%5 == 0)
		p(5);
	if(num%7 == 0)
		p(7);
	if(num%3 != 0 && num%5 != 0 && num%7 != 0)
		printf("n");
	return 0;
}
void p(int n)
{
	if(oper)
		printf(" ");
	printf("%d", n);
	oper = 1;
}


int main()
{int a;
	scanf("%d",&a);
		if(a%3==0)
		{	printf("3");
			if(a%5==0)
			{	printf(" 5");
				if(a%7==0)
					printf(" 7");
				else
				return 0;
			}
			else
			{	if(a%7==0)
					printf(" 7");
				else
				return 0;
			}
		}
		else
		{	if(a%5==0)
			{	printf("5");
				if(a%7==0)
					printf(" 7");
				else
				return 0;
			}
			else
			{	if(a%7==0)
					printf("7");
				else
                    printf("n");
					return 0;
			}
		}

}


int main()
{
	int n,i,j=3,flag=0;
	scanf("%d",&n);
	for (i=3;i<=7;i+=2)
	{
		if (n%i==0&&flag==0)
		{
			printf("%d",i);
			flag=1;
		}
		else if (n%i==0&&flag==1) printf(" %d",i);
		else j--;
	}
	if (j==0) printf ("n");
	return 0;
}


  int main()
  {int a,b,c,d;
   scanf("%d",&a);
   b=a%3;
   c=a%5;
   d=a%7;
   if (b==0)
     {printf("3");
     if (c==0)
        printf(" 5");
     if (d==0)
        printf(" 7");
      }
   else if(c==0)
        {printf("5");
         if(d==0)
           printf(" 7");
         }
        else if(d==0)
             printf("7");
             else
             printf("n");
  return 0;
  }


int flag;

void out_put(int num)
{
	++flag;
	if (flag != 1) cout << " ";
	cout << num;
	return;
}

int main()
{
	int n;
	flag = 0;
	cin >> n;
	if (n % 3 == 0) out_put(3);
	if (n % 5 == 0) out_put(5);
	if (n % 7 == 0) out_put(7);
	if (flag == 0) cout << "n";
	return 0;
}


int main(){
int a,b,c;
scanf("%d",&a);
if(a%3==0)
   if(a%5==0)
      if(a%7==0)
          printf("3 5 7");
      else
          printf("3 5");
   else
       if(a%7==0)
           printf("3 7");
        else
           printf("3");
else
    if(a%5==0)
      if(a%7==0)
          printf("5 7");
      else
          printf("5");
   else
       if(a%7==0)
           printf("7");
        else
           printf("n");
return 0;
}


int main()
{
    int number;
    cin>>number;
    if(number%3==0&&number%5==0&&number%7==0)
    cout<<"3 5 7"<<endl;
    if(number%3==0&&number%5==0&&number%7!=0)
    cout<<"3 5"<<endl;

    if(number%3==0&&number%5!=0&&number%7==0)
    cout<<"3 7"<<endl;

    if(number%3!=0&&number%5==0&&number%7==0)
    cout<<"5 7"<<endl;

    if(number%3==0&&number%5!=0&&number%7!=0)
    cout<<"3"<<endl;

    if(number%3!=0&&number%5==0&&number%7!=0)
    cout<<"5"<<endl;

    if(number%3!=0&&number%5!=0&&number%7==0)
    cout<<"7"<<endl;

    if(number%3!=0&&number%5!=0&&number%7!=0)
    cout<<"n"<<endl;
    cin.get();cin.get();cin.get();
    return 0;
    }


int main()
{
    int j,n,e,shuru[501],shuchu[501];
    j=0;
    scanf("%d",&n);
    for(int i=0;i<=n-1;i++)
    {
        scanf("%d",&shuru[i]);
        if(shuru[i]%2==1)
        {
             shuchu[j]=shuru[i];
             j=j+1;
        }

    }
    for(int k=1;k<j;k++)
    {
        for(int m=0;m<j-k;m++)
        {
            if(shuchu[m]<shuchu[m+1])
            {
               e=shuchu[m+1];
               shuchu[m+1]=shuchu[m];
               shuchu[m]=e;
            }
        }
        printf("%d,",shuchu[j-k]);
    }

     for(int m=0;m<j-j;m++)
        {
            if(shuchu[m]<shuchu[m+1])
            {
               e=shuchu[m+1];
               shuchu[m+1]=shuchu[m];
               shuchu[m]=e;
            }
        }
        printf("%d",shuchu[j-j]);
    return 0;
}


int N,M;
int data[10010];

int main(){
    int i,t,j;
    scanf("%d",&N);
    M = 0;
    for (i = 1;i <= N ; i++){
        scanf("%d",&t);
        if (t%2) data[M++] = t;
    }
    for (i = M-1 ; i >= 0; i--){
        for (j = 0;j < i ; j++){
            if (data[j] > data[j+1]){
                data[j] = data[j+1] + data[j];
                data[j+1] = data[j] - data[j+1];
                data[j] = data[j]- data[j+1];
            }
        }
    }

    for (i = 0;i <= M-2; i++){
        printf("%d,",data[i]);
    }
    printf("%d\n",data[i]);

    return 0;
}


int main()
{
	void maopao(int n,int a[]);
	int shuzu1[500],shuzu2[500];
	int n,i,j;
	scanf("%d",&n);
	for(i=0;i<n;i++)
		scanf("%d",&(shuzu1[i]));
	for(i=j=0;i<n;i++)
		if(shuzu1[i]%2==1){
			shuzu2[j]=shuzu1[i];
			j++;
		}
	maopao(j,shuzu2);
	for(i=0;i<j-1;i++)
		printf("%d,",shuzu2[i]);
	printf("%d\n",shuzu2[j-1]);
	return 0;
}

void maopao(int n,int a[]){
	int i,j,temp;
	for(i=0;i<n-1;i++)
		for(j=0;j<n-1-i;j++)
			if(a[j]>a[j+1]){
				temp=a[j];
				a[j]=a[j+1];
				a[j+1]=temp;
			}
}


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


int main()
{
	int n,i,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==1)j++;
		else a[i]=0;
	}
	sort(a,a+n);
	for(i=n-j;i<n;i++){
		if(i==n-j)cout<<a[i];
		else cout<<","<<a[i];}
	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,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 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 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;
}


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;
	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;
}


/*
 * s.cpp
 *
 *  Created on: 2013-11-3
 *      Author: shu
 */
int main(){
	int N;
	cin>>N;
	int i,a[N];
	for(i=0;i<N;i++)
		cin>>a[i];
	sort(a,a+N);
	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 maxlndex,e,i,k,n,t=0;
	int sz[500];
    scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%d",&sz[i]);
	}
    for(k=1;k<n+1; k++){
	maxlndex=0;
	for(i=0;i<n-k+1;i++)
	{
        if(sz[i]>sz[maxlndex])
		{
			maxlndex=i;
		}
	}

	if(maxlndex!=n-k)
	{
		e=sz[maxlndex];
		sz[maxlndex]=sz[n-k];
		sz[n-k]=e;
	}
	}
	for(i=0;i<n;i++)
	{
		if(sz[i]%2!=0)
		{
			t=i;
		}
	}
	for(i=0;i<n;i++)
	{
		if(sz[i]%2!=0)
		{if(i!=t)
		{printf("%d,",sz[i]);
		}else		{
			printf("%d",sz[i]);
		}
		}
	}
	return 0;
}


int main()
{
    int n,t,num=-1,a[500];
    scanf("%d",&n);
    for (int i=1;i<=n;i++)
    {
        scanf("%d",&t);
        if (t%2==1){num++;a[num]=t;}// choose odd number
    }
    sort(a,a+num+1);//sort the numbers
    printf("%d",a[0]);
    for (int i=1;i<=num;i++) printf(",%d",a[i]);// print

    return 0;
}


int main()
{
  int n,i;
  int a[501];
  int b[501];
  int j=0;
  int maxIndex, e;

  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;
	  }
  }

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

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

  return 0;
}


/*
 *  Name:JudgeCars.cpp
 *
 *  Created on: 2012-11-05
 *  Author: ??
 *  Function?????????
 */

int main()
{
	int N, count=0, i, j, temp;
	cin >> N;
	int shuru[N], shuchu[N];
	for (i=0;i<N;i++){
		cin >> shuru[i];
		if (shuru[i]%2==1){
			shuchu[count]=shuru[i];
			count++;
		}
	}
	for (i=0;i<count-1;i++){
		for (j=0;j<count-1-i;j++){
			if (shuchu[j]>shuchu[j+1]){
				temp=shuchu[j];
				shuchu[j]=shuchu[j+1];
				shuchu[j+1]=temp;
			}
		}
	}
	for (i=0;i<count;i++){
		if (i!=0)
			cout << ',';
		cout << shuchu[i];
	}
}


int main(){
	int n;
	scanf("%d",&n);
	int sz[LEN];
	for(int t=0;t<n;t++){
		scanf("%d",&sz[t]);
	}
	for(int m=0;m<n;m++){
		int e;
		for(int i=0;i<n-m;i++){
            if(sz[i]>sz[i+1]){
				e=sz[i+1];
				sz[i+1]=sz[i];
				sz[i]=e;
			}
		}
	}
	int xsz[LEN];
	int p=0;
	for(int q=0;q<n;q++){
		int s;
		s=(sz[q])%2;
		if(s==1){
            xsz[p]=sz[q];
			p++;
		}
	}
	for(int r=0;r<p-1;r++){
		printf("%d,",xsz[r]);
	}
	printf("%d",xsz[p-1]);
	return 0;
}


int main(){
	int n,i,m,k,c;
	m=0;
	int sz[LEN],p[LEN];
	scanf("%d",&n);
	for(i=0; i<n; i++){
		scanf("%d",&sz[i]);
	}
    m=0;
	for(i=0; i<n; i++){
		if(sz[i]%2!=0){
		p[m]=sz[i];
		m++;
		}
	}
	c=m;
    int maxIndex, e;
    for(k=1;k<=c; k++){
	maxIndex=0;
	for(m=0; m<=c-k; m++){
			if(p[m]> p[maxIndex]){
					maxIndex=m;
			}
	}
	if(maxIndex != c-k){
		e = p[maxIndex];
		p[maxIndex] = p[c-k];
		p[c-k]=e;
	}
}

    for(m=0; m<c-1; m++){
		printf("%d,",p[m]);
	}
   printf("%d",p[m]);
    return 0;
}


const int MAXN = 600;

int main()
{
    int n; scanf("%d", &n);
    int num[MAXN], temp;
    int i, j, index = 0;
    for (i = 0; i < n; ++ i)
    {
        scanf("%d", &temp);
        if (temp % 2 == 1)
           num[index ++] = temp;
    }
    for (i = 0; i < index; ++ i)
        for (j = index - 1; j > 0; -- j)
            if (num[j] < num[j - 1])
               {
                        temp = num[j - 1];
                        num[j - 1] = num[j];
                        num[j] = temp;
               }
    printf("%d", num[0]);
    for (i = 1; i < index; ++ i)
        printf(",%d", num[i]);
}


/*
 * oddup.cpp
 *
 *  Created on: 2013-10-31
 *      Author: ??
 */
int main(){
	int n,t;cin>>n;int a[n];
	for(int i=0;i<n;i++){
		cin>>a[i];
		if(a[i]%2==0)a[i]=-1;
	}
	for(int jj=1;jj<n;jj++){
       for(int ii=0;ii<n-jj;ii++){
    	   if(a[ii]<0)continue;
    	   if(a[ii+1]<a[ii]){
    		   t=a[ii];a[ii]=a[ii+1];a[ii+1]=t;
    	   }
       }
	}
	int num=1;
	for(int iii=0;iii<n;iii++){
		if(a[iii]<0)continue;
		if(num==1){cout<<a[iii];num++;}
		else cout<<","<<a[iii];
	}
	return 0;
}


void bubble(int a[],int len)
{
	int i, j, temp;
	for(j=1; j<len; j++)
	{
		for(i=0; i<len-j; i++)
		{
			if(a[i]>a[i+1])
			{
				temp=a[i];
				a[i]=a[i+1];
				a[i+1]=temp;
			}
		}
	}
}
void main()
{
	int *pi, n, *pj, a[500], b[500]={0};
	scanf("%d",&n);
	for(pi=a; pi<(a+n); pi++)
		scanf("%d",pi);
	for(pi=a, pj=b; pi<(a+n); pi++)
	{
		if((*pi)%2==1)
		{
			*pj=*pi;
			pj++;
		}
	}
	bubble(b,pj-b);
	printf("%d",*b);
	for(pi=b+1; pi<pj; pi++)
		printf(",%d",*pi);
}


int t[10001];
int comp ( const void *a, const void *b )
{
    return * ( int * ) a - * ( int * ) b;
}
int main()
{

   int i,n;
   scanf("%d",&n);
    for(i=0;i<n;i++)

    scanf("%d",&t[i]);
    qsort(t,n,sizeof(int),comp);
    for(i=0;t[i]%2;i++)
    printf("%d",t[i]);
    for(;i<n;i++)
    if(t[i]%2)
    printf(",%d",t[i]);
    return 0;
}


int main(){
	int an[500];
	int n,i,max=1,point=1;
	char x;
	x=',';
	scanf("%d",&n);
	for(i=0;i<n;i++)
		scanf("%d",&an[i]);
	for(i=0;i<n;i++){
		if(an[i]>max&&an[i]%2==1)
			max=an[i];
	}
	while(point<=max-2){
		for(i=0;i<n;i++){
			if(an[i]==point){
				printf("%d%c",an[i],x);
				break;
			}
		}
		point+=2;
	}
	for(i=0;i<n;i++){
		if(an[i]==point){
			printf("%d",an[i]);
			break;
		}
	}
	return 0;
}


int main()
{int n,i,j,chan,countor;
 scanf("%d",&n);
 int* num=(int*)malloc(n*sizeof(int));
 for(i=0;i<n;i++)
    scanf("%d",num+i);

 for(i=0;i<n;i++)
    for(j=0;j<n-i-1;j++)
 {

     if(*(num+j)>*(num+j+1))
     {
         chan=*(num+j);
         *(num+j)=*(num+j+1);
         *(num+j+1)=chan;
     }
 }
for(i=0,countor=0;i<n;i++)
 {
	 if(*(num+i)%2!=0)
	 countor++;
 }
 for(i=0;i<n;i++)
 {
	 if(*(num+i)%2==0)
		 continue;
	 else
	 {
		 countor--;
		 if(countor==0) printf("%d",*(num+i));
		 else printf("%d,",*(num+i));
	 }
 }
return 0;

}


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


int data[1000];
int comma;

int main(int argc, const char * argv[])
{
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> data[i];
    }
    sort(data, data + n);
    for (int i = 0; i < n; i++) {
        if (data[i] / 2 * 2 != data[i]) {
            if (comma) {
                cout << ",";
            }
            comma = true;
            cout << data[i];
        }
    }
}


int main ()
{
	int n;
	int a[501];
	int number, k = 1;
	cin >> n;
	for (int i = 1; i <= n; i++)
	{
		cin >> number;
		if (number % 2 == 1)
		{
			a[k] = number;
			k++;
		}
	}
	for (int m = 1; m <= k - 2; m++)
	{
		int p = m;
		for (int l = m + 1; l <= k - 1; l++)
		{
			if (a[p] > a[l])
		{
			int t = a[l];
			a[l] = a[p];
			a[p] = t;
		}
		}

	}
	for (int n = 1; n <= k - 1; n++)
	{
		if (n == 1)
			cout << a[n];
		else cout << "," << a[n];
	}
	return 0;
}


int compare(const void * elem1, const void * elem2)
{
	int *a=NULL,*b=NULL;
	a=(int *)elem1;
	b=(int *)elem2;
	return(*a-*b);
}
main()
{
    int n,i,j=0,x=0,flag=0;
    scanf("%d",&n);
    int a[n];
    for(i=0;i<n;i++)
    scanf("%d",&a[i]);

    int b[n];
    for(i=0;i<n;i++)
    b[i]=0;

    for(i=0;i<n;i++)
    if(a[i]%2==1)
    {
        b[j]=a[i];
        j++;
    }
    qsort(b,n,sizeof(int),compare);
    for(i=0;i<n;i++)
    {
    if(b[i]>0&&flag==0)
       {
           printf("%d",b[i]);
           flag=1;
       }
    else if(b[i]!=0)
    printf(",%d",b[i]);
    }

}


int main(){
	int n,e;
	scanf("%d",&n);
	int *sz=(int*)malloc(sizeof(int)*n);
    int *js=(int*)malloc(sizeof(int)*n);
	int p=0;
	for(int i=0;i<n;i++){
		scanf("%d",&sz[i]);

		if((sz[i]%2)==1){
			js[p]=sz[i];

			p++;

		}
	}

	for(int w=1;w<p;w++){
		for(int h=0;h<(p-w);h++){
			if(js[h]>js[h+1]){
				e=js[h+1];
				js[h+1]=js[h];
				js[h]=e;
			}
		}
	}
	for(int y=0;y<(p);y++){
		if(y<p-1){
			printf("%d,",js[y]);
		}else{
			printf("%d",js[y]);
		}
	}

	return 0;
}


int main(){
	int n;
	scanf("%d",&n);
	int i,j;
	int shuzu[500];
	int jishu[500];
	for(i=0;i<n;i++){
		scanf("%d",&shuzu[i]);
	}
	int e;
	for(i=1;i<=n;i++){
		for(j=0;j<n-i;j++){
			if(shuzu[j]>shuzu[j+1]){
				e=shuzu[j+1];
				shuzu[j+1]=shuzu[j];
				shuzu[j]=e;
			}
		}
	}
	for(j=0;j<n;j++){
		for(i=0;i<n;i++){
			if(j==0&&shuzu[i]%2!=0){
				jishu[j]=shuzu[i];
				break;
			}else if(shuzu[i]>jishu[j-1]&&shuzu[i]%2!=0){
				jishu[j]=shuzu[i];
				break;
			}
		}
		if(i==n){
			break;
		}
	}

	for(i=0;i<j;i++){
		if(i==0){
			printf("%d",jishu[i]);
		}else{
			printf(",%d",jishu[i]);
		}
	}
return 0;
}


int cmp(const void *a,const void *b){
	return *(int *)a-*(int *)b;
}

int main(){
	int N,inA[MAXN],oddA[MAXN],M=0;
	cin>>N;
	for(int i=0;i<N;i++) cin>>inA[i];
	for(int i=0;i<N;i++){
		if(inA[i]%2){
 			oddA[M]=inA[i];
			M++;
		}
	}
	qsort(oddA,M,sizeof(int),cmp);
	for(int i=0;i<M;i++){
		cout<<oddA[i];
		if(i!=M-1) cout<<',';
	}
	return 0;
}


int f(int x)
{  return x%2; }

int cmp(const void*a,const void*b)
{  return *(int*)a-*(int*)b; }

main()
{
      int i,j=0,n,x;
      int *b;
      scanf("%d",&n);
      b=(int*)malloc(n*sizeof(int));
      for(i=0;i<n;i++)
      {
           scanf("%d",&x);
           if(f(x)){ b[j]=x;j++;}
      }
      qsort(b,j,sizeof(int),cmp);
      for(i=0;i<j-1;i++) printf("%d,",b[i]);
      printf("%d",b[i]);

}


int judge(int x){
if(x%2==0){return 0;}
else{return 1;}
}
int main(){

int n,number[500],count,i,p;
scanf("%d",&n);
for(i=0;i<n;i++){scanf("%d",&number[i]);}
for(i=0;i<n;i++){for(p=0;p<n-1;p++){if(number[p]>number[p+1]){number[p]+=number[p+1];number[p+1]=number[p]-number[p+1];number[p]-=number[p+1];}}}
count=0;
for(i=0;i<n;i++){
if(judge(number[i])&&count==0){printf("%d",number[i]);count=1;continue;}
if(judge(number[i])&&count==1){printf(",%d",number[i]);}
}

return 0;}


int main(){
    int N,i,j,s;
    scanf("%d",&N);
    int jishu[501];
    int sz[501];
    j=0;
    for(int i=0;i<N;i++){
        scanf("%d" ,&sz[i]);
        if(sz[i]%2==1){
            jishu[j]=sz[i];
            j++;
        }
    }
    s=j;
    int e;
    for(int i=0;i<s;i++){
      for(int j=0;j<s-i;j++){
         if(jishu[j]>jishu[j+1]){
             e=jishu[j];
             jishu[j]=jishu[j+1];
             jishu[j+1]=e;
         }
      }
    }
    for(int j=0;j<s;j++){
       if(j!=s-1){
        printf("%d,",jishu[j]);
        }else{
            printf("%d",jishu[j]);
        }
    }

   return 0;
}


int main()
{
	int num[500];
	int n;
	int i;
	int sum=0;
	int a;
	int j;
	int k;
	int g;
	scanf("%d",&n);
	for(i=0;i<=n-1;i++)
	{
		scanf("%d",&a);
		if(a%2==1)
		{
			num[i]=a;
			sum=sum+1;
		}

		else
			num[i]=0;
	}
	for(j=1;j<=n-1;j++)
	{
		for(i=n-1;i>=j;i--)
		{
			if(num[i]>=num[i-1])
			{	g=num[i-1];
				num[i-1]=num[i];
				num[i]=g;
			}
		}
	}
         printf("%d",num[sum-1]);
	for(k=sum-2;k>=0;k--)
		printf(",%d",num[k]);
}


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


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


/*
 * ct.c
 *
 *  Created on: 2011-11-24
 *      Author: lin
 */

int mysort(void *a, void *b)
{
	return *(int *)a - *(int *)b;
}

int main()
{
	int in[100];
	int num;
	int tmp;
	scanf("%d", &num);
	int count = 0;
	while(num--)
	{
		scanf("%d",&tmp);
		if(tmp % 2)
		{
			in[count] = tmp;
			++count;
		}
	}
	qsort(in,count,sizeof(int),mysort);
	for(tmp = 0; tmp < count - 1; ++tmp)
	{
		printf("%d,", in[tmp]);
	}
	printf("%d", in[count - 1]);
	return 0;

}


int main(){
	int i,j,k,s,maxIndex,N,e,m;
	int sz[500];
	scanf("%d",&N);
	for(i=0;i<N;i++){
			scanf("%d",&(sz[i]));
	}
	for(k=1;k<=N;k++){
		maxIndex=0;
		for(j=0;j<=N-k;j++){
			if(sz[j]>sz[maxIndex]){
					maxIndex = j;
			}
		}
		if(maxIndex !=N-k){
		e=sz[maxIndex];
		sz[maxIndex]=sz[N-k];
		sz[N-k]=e;
		}
	}
	for(s=0;s<N;s++){
		if(sz[s]%2!=0){
			printf("%d",sz[s]);
			break;
		}
	}
	for(m=s+1;m<N;m++){
		if(sz[m]%2!=0){
			printf(",%d",sz[m]);
		}
	}
		return 0;
}


int main()
{
	int n,k=0,i,m,e,l;
	scanf("%d",&n);
	int *sz=(int*)malloc(sizeof(int)*n);
	int *zz=(int*)malloc(sizeof(int)*n);
	for(i=0;i<n;i++){
		scanf("%d",&sz[i]);
		if(sz[i]%2==1){
			zz[k]=sz[i];
			k++;}
	}
	l=k;
	for(m=1;m<=l;m++){
		for(k=0;k<l-m;k++){
			if(zz[k+1]<zz[k]){
				e=zz[k];
				zz[k]=zz[k+1];
				zz[k+1]=e;
			}
	}
}
	for(k=0;k<l-1;k++){
		printf("%d",zz[k]);
		printf(",");
	}
	printf("%d",zz[l-1]);
	free(sz);
	free(zz);
	return 0;
}


int main(){
    int N,m,n,i,j,tran;
    scanf("%d",&N);
    int zhengzhengshu[N];
    int jishu[N];
    for(i=0;i<N;i++){
        scanf("%d",&zhengzhengshu[i]);
    }
    for(i=0,j=1;i<N;i++){
        if(zhengzhengshu[i]%2==1){
            jishu[j]=zhengzhengshu[i];
            j=j+1;
        }
    }
    for(m=1;m<j;m++){
        for(n=m;n<j;n++){
            if(jishu[m]>jishu[n]){
                tran=jishu[m];
                jishu[m]=jishu[n];
                jishu[n]=tran;
            }
        }
    }
    for(m=1;m<j;m++){
        printf("%d",jishu[m]);
        if(m!=j-1){
            printf(",");
        }

    }
    return 0;
}


/*
 * pratise.cpp
 *
 *  Created on: 2013-10-29
 *      Author: dyx
 */
int main()
{
	int n;
	cin >> n;
	int i;
	int z[n];
	int a=0;
	for(i=0;i<n;i++)
		cin >>z[i];
	sort(&z[0],&z[n]);
	for(i=0;i<n;i++)
	{
		if(z[i]%2==1)
			if(a==0)
			{
				cout << z[i];
				a++;
			}
			else
				cout << "," << z[i];

	}

}


 int *data;
 int InitData();
 void Sort(int a[],int n)
 {
     int i,j,k,t;
     for(i=0;i<n;i++){
         k=i;
         for(j=i+1;j<n;j++){
             if(a[j]<a[k]){
                 k=j;
             }
         }
         if(k!=i){
             t=a[k];
             a[k]=a[i];
             a[i]=t;
         }
     }
 }
 void PrintData(int a[],int n){
     int i;
     for(i=0;i<n;i++){
         if(a[i]%2==1&&i>0)
         printf(",%d",a[i]);
     }
 }

 int main (){
     int a[10000];
     int i,n;
     scanf("%d",&n);
     for(i=0;i<n;i++){
         scanf("%d",&(a[i]));
     }
     Sort(a,n);
     printf("%d",a[0]);
     PrintData(a,n);
     return 0;
 }


int main ()
{
	int a[510] = {0};
	int n, count, j, k, num, temp, i;
	cin >> n;
	count = 1;
	for (k = 1; k <= n; k++)
	{
		cin >> num;
		if (num % 2 == 1)
		{
			a[count] = num;
			count++;
		}
	}
	count--;
	for (i = 1; i <= count; i++)
	{
		for (j = 1; j <= count - i; j++)
		{
			if (a[j] > a[j + 1])
			{
				temp = a[j];
				a[j] = a[j + 1];
				a[j + 1] = temp;
			}
		}
	}
	cout << a[1] ;
	for (i = 2; i <= count; i++)
	{
		cout << "," << a[i] ;
	}
	cout << endl;
	return 0;
}


int main()
{
    int n,index,temp;
    int js=0,js1=0,i,j,k,p,q;
    scanf("%d",&n);
    int a[n];
    for(i=0;i<n;i++)
    scanf("%d",&a[i]);
    for(k=0;k<=n-2;k++){
        index=k;
        for(p=k+1;p<n;p++){
            if(a[p]<a[index]){
                index=p;
            }
        }
        temp=a[k],a[k]=a[index],a[index]=temp;
    }
    for(q=0;q<n;q++){
        if(a[q]%2!=0)js=js+1;
    }
    for(j=0;j<n;j++){
        if(a[j]%2!=0&&js1<js){
            js1++;
            if(js1!=js)
            printf("%d,",a[j]);
            if(js1==js)
            printf("%d",a[j]);
        }
    }
    return 0;
}


int main()
{
    int N,i,k,e,sz[500];
    scanf("%d",&N);
    for(i=0;i<N;i++){
                     scanf("%d",&sz[i]);
                     }
    int s=0;
    for(i=0;i<N;i++){
                     if(sz[i]%2==0){
                                    sz[i]=0;
                                    s++;
                                    }
                                    }
    for(k=1;k<=N;k++){
                      int maxlndex=0;
                      for(i=0;i<=N-k;i++){
                          if(sz[maxlndex]<sz[i]){
                                            e=sz[maxlndex];
                                            sz[maxlndex]=sz[i];
                                            sz[i]=e;
                                            }
                                            if(maxlndex!=N-k){
                                                              e=sz[maxlndex];
                                                              sz[maxlndex]=sz[N-k];
                                                              sz[N-k]=e;
                                                              }
                                            }
                                            }
    for(i=s;i<N-1;i++){
                       printf("%d,",sz[i]);
                       }
                       printf("%d",sz[N-1]);
                       return 0;
                       }


int main()
{
	int n,i,j,max=1,m;
	int sz[500];
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%d",&sz[i]);
		if(sz[i]>max&&sz[i]%2!=0)
			max=sz[i];
	}
	for(j=1;j<=max;j=j+2)
	{

		if(j==max)
				printf("%d",j);
		else
		{
		for(m=0;m<n;m++)
		{
		     if(sz[m]==j)
				printf("%d,",j);
		}
		}
	}

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];

}


/**
* @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;
    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;
}


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;
}


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 N;
	scanf("%d", &N);
	int number[NUMBER];
	int odds[NUMBER];
	int i=0;
	int j=0;
	int k;
	int r;
	while(i<N){
		scanf("%d", &number[i]);
		i++;
	}
	i=0;
	while(i<N){
		if((number[i]%2)!=0){
			odds[j]=number[i];
			j++;
			i++;
		}
		else{
			i++;
		}
	}
	for(k=j-1;k>0;k--){
		for(r=0;r<k;r++){
			if(odds[r]>odds[r+1]){
				int tmp;
				tmp=odds[r+1];
				odds[r+1]=odds[r];
				odds[r]=tmp;
			}
		}
	}
	i=0;
	while(i<j){
		if(i<(j-1)){
			printf("%d,", odds[i]);
			i++;
	}
		else if(i=(j-1)){
			printf("%d", odds[i]);
			i++;
		}
	}

		return 0;
	}


int main()
{
    int num[500];
    int i, j, n, a, temp, m = 0;
    cin >> n;
    for ( i = 1; i <= n; i++ )
    {
        cin >> a;
        if ( a % 2 == 1 )
        {
             m = m + 1;
             num[m] = a;
        }
    }
    for ( i = 1; i < m; i++ )
        for ( j = i + 1; j <= m; j++ )
            if ( num[i] > num[j] )
            {
                 temp = num[i];
                 num[i] = num[j];
                 num[j] = temp;
            }
    cout << num[1];
    for ( i = 2; i <= m; i++ )
        cout << "," << num[i];
    return 0;
}


int main(){
    int N=0;
    scanf("%d",&N);
    int i=0;
    int zhengzhengshu[501]={0};
    for(i=0;i<N;i++){
        scanf("%d",&zhengzhengshu[i]);
    }
    int jishu[500]={0};
    int j=0,p=0;
    for(j=0,p=0;j<N;j++){
        if(zhengzhengshu[j]%2==1){
            jishu[p]=zhengzhengshu[j];
            p++;
        }
    }
    int temp=0;
    int q=0;
    for(q=0;q<p;q++){
        for(int m=q;m<p;m++){
            if(jishu[q]>jishu[m]){
                temp=jishu[q];
                jishu[q]=jishu[m];
                jishu[m]=temp;
            }
        }
    }
    for(int b=0;b<p-1;b++){
        printf("%d,",jishu[b]);
    }
    int b=p-1;
    printf("%d",jishu[b]);
    return 0;
}


//
//  main.cpp
//  11.5homework
//  ??????
//  Created by ??? on 11/5/12.
//  Copyright (c) 2012 airjcy. All rights reserved.
//

void ySwap(int a[],int i,int j)
{
    int t = a[i];
    a[i] = a[j];
    a[j] = t;
}

void yQsort(int a[],int left,int right)
{
    if (left > right) {
        return;
    }
    int key = a[left];
    int i = left;
    int j = right;
    while (i < j) {
        while (i < j && a[j] >= key) {
            j --;
        }
        ySwap(a, i, j);
        while (i < j && a[i] <= key) {
            i ++;
        }
        ySwap(a, i, j);
    }
    yQsort(a, left, i - 1);
    yQsort(a, i + 1, right);
}

int main(int argc, const char * argv[])
{

    int n = 0;
    cin >> n;
    int i = 0,t = 0;
    int a[n]; //???????
    int countOfUnevens = 0;
    for (i = 0; i < n; i  ++) {
        cin >> t;
        if (t % 2 != 0) {
            a[countOfUnevens] = t;
            countOfUnevens ++;
        }
    }
    yQsort(a, 0, countOfUnevens - 1);
    for (i = 0; i < countOfUnevens - 1; i ++) {
        cout << a[i] << ",";
    }
    cout << a[i];
}


int main(){
    int n,i,k,t;
    int shuzu[500],shushu[500];
    scanf("%d",&n);
    for(i=0;i<n;i++){
                     scanf("%d",&shuzu[i]);
                     if(shuzu[i]%2!=0){
                                       shushu[i]=shuzu[i];
                                       }
                     }
    for(k=1;k<=n;k++){
                     for(i=0;i<n-k;i++){
                                        if(shushu[i]>shushu[i+1]){
                                                                  t=shushu[i+1];
                                                                  shushu[i+1]=shushu[i];
                                                                  shushu[i]=t;
                                                                  }
                                        }
   }
   for(i=0;i<n;i++){
                    if((shushu[i]!=0)&&(i!=n-1)){
                                     printf("%d,",shushu[i]);
                                     }
                    if(i==n-1){
                               printf("%d",shushu[i]);
                               }
                    }
   return 0;
}


//
//  main.cpp
//  hw
//
//  Created by ? ? on 12-12-13.
//  Copyright (c) 2012? ? ?. All rights reserved.
//

int cmp(const void *a, const void *b)
{
    return(*(int *)a-*(int *)b);
}

int main()
{
    int n,k,odd[1000]={0},c=0;
    cin>>n;
    for (int i=0; i<n; i++) {
        int num;
        cin>>num;
        if (num%2) {
            odd[c]=num;
            c++;
        }
    }
    qsort(odd, c, sizeof(int), cmp);
    cout<<odd[0];
    for (int i=1; i<c; i++) {
        cout<<","<<odd[i];
    }
    return 0;
}


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


int main(){
	int N, sz[MAX], odd[MAX];
	scanf("%d", &N);
	for(int i = 0; i < N; i++){
		scanf("%d", &sz[i]);
	}
	int remainder, k = 0;
	for(int j = 0; j < N; j++){
		remainder = sz[j] % 2;
		if(remainder != 0){
			odd[k] = sz[j];
			k++;
		}
	}
//find the odd numbers
	int t;
	for(int p = 1; p < k; p++){
		for(int q = 0; q < k-p; q++){
			if( odd[q] > odd[q+1] ){
				t = odd[q];
				odd[q] = odd[q+1];
				odd[q+1] = t;
			}
		}
	}
//arrange the numbers from small to large
	for(int m = 0; m < k; m++){
		if(m == k-1){
			printf("%d", odd[m]);
		}else{
			printf("%d,", odd[m]);
		}
	}
	return 0;
}


/*
 * 1.cpp
 *
 *  Created on: 2010-12-24
 *      Author: 10265
 */
int main()
{
	int n;
	int xulie[501],jishu[501];
	int i,j,k=0;
	cin>>n;
   for(i=0;i<n;i++){
	cin>>xulie[i];
	if(xulie[i]%2==1){
	jishu[k]=xulie[i];
	k++;
	}
   }
	for(i=0;i<k-1;i++){
		for(j=0;j<k-1-i;j++){
			if(jishu[j]>jishu[j+1]){
				int temp=jishu[j];
				jishu[j]=jishu[j+1];
				jishu[j+1]=temp;
			}
		}
	}
	for(i=0;i<k-1;i++)
		cout<<jishu[i]<<",";
	cout<<jishu[k-1]<<endl;
	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;
}


//
//  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,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;
}


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 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()
{
	void largen(char s[]);
	int flag;
	char s1[80],s2[80];
	gets(s1);
	gets(s2);
	largen(s1);
	largen(s2);
	flag=strcmp(s1,s2);
	if(flag>0)
		printf(">\n");
	else if(flag<0)
		printf("<\n");
	else printf("=\n");
	return 0;
}

void largen(char s[])
{
	int i;
	for(i=0;;i++){
		if(s[i]>='a'&&s[i]<='z')
			s[i]-=32;
		else if(s[i]=='\0')
			break;
	}
}


int main()
{
    char a[80],b[80],i,j,k;
    gets(a);
    gets(b);
    j=strlen(a);
    k=strlen(b);
    for (i=0;i<j;i++)
    {
        if (isupper(a[i]))
        a[i]=tolower(a[i]);
    }
    for (i=0;i<k;i++)
    {
        if (isupper(b[i]))
        b[i]=tolower(b[i]);
    }
    if (strcmp(a,b)>0)
    printf(">");
    if (strcmp(a,b)<0)
    printf("<");
    if (strcmp(a,b)==0)
    printf("=");
    return 0;
}


int main()
{
	char a[85] ;
	char b[85];
	gets(a);
	gets(b);
	for(int i = 0;i<strlen(a);i++)
	{
		if(a[i] > 'Z')
			a[i] -= 32;
	}
	for(int i = 0;i<strlen(b);i++)
	{
		if(b[i] > 'Z')
			b[i] -= 32;
	}
	int key = strcmp(a,b);
	if(key == 0) cout<<"=";
	else if(key == 1) cout<<">";
	else cout<<"<";
}


void main()
{
	int i;
	char str1[80],str2[80];
	gets(str1);
	gets(str2);
	for(i=0;i<80;i++)
	{
		if(str1[i]<='Z'&&str1[i]>='A')
			str1[i]=str1[i]+32;
		else continue;
		if(str1[i]<='z'&&str1[i]>='a')
			str1[i]=str1[i];
		else continue;
	}
	for(i=0;i<80;i++)
	{
		if(str2[i]<='Z'&&str2[i]>='A')
			str2[i]=str2[i]+32;
		else continue;
		if(str2[i]<='z'&&str2[i]>='a')
			str2[i]=str2[i];
		else continue;
	}
	if(strcmp(str1,str2)>0)
		printf(">");
	if(strcmp(str1,str2)==0)
		printf("=");
	if(strcmp(str1,str2)<0)
		printf("<");
}


int main(void)
{
    char s1[MAX], s2[MAX];
    gets(s1);
    gets(s2);
    int i=0;
    while(s1[i]!='\0')
    s1[i]=toupper(s1[i]),i++;
      i=0;
      while(s2[i]!='\0')
    s2[i]=toupper(s2[i]),i++;
    if(strcmp(s1,s2)>0)
    printf(">");
    else if(strcmp(s1,s2)<0)
    printf("<");
    else
    printf("=");
    return 0;
}


int main()
{
	char str1[100], str2[100];
	int i;
	cin.getline (str1, 100);
	cin.getline (str2, 100);
	for (i = 0; ; i++)
	{
		if (str1[i] == '\0')
			break;
		if (str1[i] >= 'a')
			str1[i] = str1[i] - 32;
	}
	for (i = 0; ; i++)
	{
		if (str2[i] == '\0')
			break;
		if (str2[i] >= 'a')
			str2[i] = 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;
}


//
//  main.cpp
//  ????
//
//  Created by ? ? on 12-11-22.
//  Copyright (c) 2012? ? ?. All rights reserved.
//

int main(int argc, const char * argv[])
{int i;
    char str1[100],str2[100];
    gets(str1);
    gets(str2);
    for(i=0;str1[i]!=0;i++)
    {
        if(str1[i]<'a'&&str1[i]>='A'&&str1[i]<='Z')
    {
        str1[i]+=32;
    }
    }
    for(i=0;str2[i]!=0;i++)
    {if(str2[i]<'a'&&str2[i]>='A'&&str2[i]<='Z')
    {
        str2[i]+=32;
    }
    }
    switch (strcmp(str1, str2)) {
        case -1:
            cout<<"<";
            break;
        case 0:
            cout<<"=";
            break;
        case 1:
            cout<<">";
            break;

    }
    return 0;
}


char change(char a)
{
	char x;
	switch(a) {
	case 'A':x='a';break;
    case 'B':x='b';break;
	case 'C':x='c';break;
    case 'D':x='d';break;
	case 'E':x='e';break;
    case 'F':x='f';break;
	case 'G':x='g';break;
    case 'H':x='h';break;
    case 'I':x='i';break;
	case 'J':x='j';break;
    case 'K':x='k';break;
	case 'L':x='l';break;
    case 'M':x='m';break;
	case 'N':x='n';break;
    case 'O':x='o';break;
	case 'P':x='p';break;
    case 'Q':x='q';break;
	case 'R':x='r';break;
    case 'S':x='s';break;
    case 'T':x='t';break;
	case 'U':x='u';break;
    case 'V':x='v';break;
	case 'W':x='w';break;
    case 'X':x='x';break;
	case 'Y':x='y';break;
    case 'Z':x='z';break;
    }
	return x;
}
int main(int argc, char* argv[])
{
    char s[100],t[100],p[100],q[100];
	int i;
	gets(s);
	gets(t);
	for (i=0;s[i]!='\0';i++) {
		p[i]=change(s[i]);
	}
	p[i-1]='\0';
	for (i=0;t[i]!='\0';i++) {
		q[i]=change(t[i]);
	}
	q[i-1]='\0';
	if(strcmp(p,q)<0)
		printf("<");
	if(strcmp(p,q)>0)
		printf(">");
	if(strcmp(p,q)==0)
		printf("=");
	return 0;
}


void ast(char s[])
{
	int n,i;
	n=strlen(s);
	for(i=0;i<n;i++)
		if(s[i]>='a'&&s[i]<='z')
			s[i]=s[i]-32;
}
void main()
{
	char s1[50],s2[50];
	gets(s1);
	gets(s2);
	ast(s1);
	ast(s2);
	if(strcmp(s1,s2)>0)
		printf(">");
	else if(strcmp(s1,s2)<0)
		printf("<");
	else printf("=");
}


char change(char a)
{
	if(a>='a'&&a<='z')
		a=a-'a'+'A';
	return a;
}
int main()
{
    char a[100];
    char b[100];
    gets(a);
    gets(b);
    int a1=strlen(a);
    int a2=strlen(b);
    int i=0;
    while(i<a1&&i<a2)
    {
    	a[i]=change(a[i]);
    	b[i]=change(b[i]);
    	if(a[i]<b[i])
    	{
    		printf("<\n");
    		break;
    	}
    	if(a[i]>b[i])
    	{
    		printf(">\n");
    		break;
    	}
    	i++;
    }
    if(i==a1&&i!=a2)    		printf("<\n");
    if(i==a2&&i!=a1)    		printf(">\n");
    if(i==a1&&i==a2)     		printf("=\n");
    return 0;
}


int main()
{
    char a[100];
	gets(a);
	int m=strlen(a);
	char b[100];
	gets(b);
	int n=strlen(b);
	int c;
	if(m>n)
		c=m;
	else
		c=n;

	int i;
	for(i=0;i<c;i++)
	{

		if(a[i]>64&&a[i]<91)
			a[i]+=32;
		if(b[i]>64&&b[i]<91)
			b[i]+=32;
     	if(a[i]>b[i])
		{
			printf(">");
			break;
		}
		else if(a[i]<b[i])
		{
			printf("<");
			break;
		}
		else
		{
			continue;
		}
	}
	if(i>=c)
	{
		printf("=\n");
	}
	return 0;
}


int main()
{   int i;
	char str1[81],str2[81];//?????????
	cin.getline(str1,81);
	cin.getline(str2,81);
	for(i=0;i<81;i++)
	{
		if(str1[i]>96)
			str1[i]-=32;
        if(str2[i]>96)
			str2[i]-=32;
	}
	if(strcmp(str1,str2)>0)
		cout<<">";
	else if(strcmp(str1,str2)<0)
		cout<<"<";
	else
		cout<<"=";
	return 0;

}


int main()
{
	char a[100];
	char b[100];
	cin.getline (a ,90);
	cin.getline (b ,90);
	for (int i = 0 ; ;i++)
	{
		if (a[i] !='\0')
		{
			int m = (int)a[i];
			int n = (int)b[i];
			if (m>=97)
				m-=32;
			if (n>=97)
				n-=32;
			if (m == n)
			{
			continue;
			}
			else
			{
				if (m>n)
				{
					cout<<">";
					return 0;
				}
				else
				{
					cout<<"<";
					return 0;
				}
			}
		}
		else
		{
			break;
		}

	}
	cout<<"=";
	return 0;
}


int main()
{
	char a[100],b[100];
	gets(a);
	gets(b);
	for(int i=0;a[i]!='\0';i++)
		a[i]=tolower(a[i]);
	for(int j=0;b[j]!='\0';j++)
		b[j]=tolower(b[j]);
	if(strcmp(a,b)>0)printf(">");
	if(strcmp(a,b)<0)printf("<");
	if(strcmp(a,b)==0)printf("=");

	return 0;
}


int main()
{
    int k;
    char sen1[80],sen2[80];
    cin.getline(sen1,80);
    cin.getline(sen2,80);
    int nlen1=strlen(sen1),nlen2=strlen(sen2);
    char B[3]={'<','=','>'};
    for(int i=0;i<nlen1;i++)
    if(sen1[i]>='A'&&sen1[i]<='Z')
    sen1[i]+='a'-'A';
    for(int i=0;i<nlen2;i++)
    if(sen2[i]>='A'&&sen2[i]<='Z')
    sen2[i]+='a'-'A';
    for(int i=0;i<nlen2;i++)
    k=strcmp(sen1,sen2);
    cout<<B[k+1];
    return 0;
}


 int main()
 {
   char str1[80],str2[80];
   gets(str1);
   gets(str2);
   int i;
    for(i=0;i<80;i++)
     {switch(str1[i]){
      case 'A':str1[i]='a'; break;
      case 'B':str1[i]='b'; break;
      case 'C':str1[i]='c'; break;
      case 'D':str1[i]='d'; break;
      case 'E':str1[i]='e'; break;
      case 'F':str1[i]='f'; break;
      case 'G':str1[i]='g'; break;
      case 'H':str1[i]='h'; break;
      case 'I':str1[i]='i'; break;
      case 'J':str1[i]='j'; break;
      case 'K':str1[i]='k'; break;
      case 'L':str1[i]='l'; break;
      case 'M':str1[i]='m';break;
      case 'N':str1[i]='n';break;
      case 'O':str1[i]='o';break;
      case 'P':str1[i]='p';break;
      case 'Q':str1[i]='q';break;
      case 'R':str1[i]='r';break;
      case 'S':str1[i]='s';break;
      case 'T':str1[i]='t';break;
      case 'U':str1[i]='u';break;
      case 'V':str1[i]='v';break;
      case 'W':str1[i]='w';break;
      case 'X':str1[i]='x';break;
      case 'Y':str1[i]='y';break;
      case 'Z':str1[i]='z';break;
      }
    }
   int j;
    for(j=0;j<80;j++)
    {  switch(str2[j]){
      case 'A':str2[j]='a';break;
      case 'B':str2[j]='b';break;
      case 'C':str2[j]='c';break;
      case 'D':str2[j]='d';break;
      case 'E':str2[j]='e';break;
      case 'F':str2[j]='f';break;
      case 'G':str2[j]='g';break;
      case 'H':str2[j]='h';break;
      case 'I':str2[j]='i';break;
      case 'J':str2[j]='j';break;
      case 'K':str2[j]='k';break;
      case 'L':str2[j]='l';break;
      case 'M':str2[j]='m';break;
      case 'N':str2[j]='n';break;
      case 'O':str2[j]='o';break;
      case 'P':str2[j]='p';break;
      case 'Q':str2[j]='q';break;
      case 'R':str2[j]='r';break;
      case 'S':str2[j]='s';break;
      case 'T':str2[j]='t';break;
      case 'U':str2[j]='u';break;
      case 'V':str2[j]='v';break;
      case 'W':str2[j]='w';break;
      case 'X':str2[j]='x';break;
      case 'Y':str2[j]='y';break;
      case 'Z':str2[j]='z';break;
      }
     }
  if( strcmp(str1,str2)==0) printf("=\n");
  if(strcmp(str1,str2)<0 )  printf("<\n");
  if( strcmp(str1,str2)>0 )  printf(">\n");

  return 0;
}


char z(char a)
{
	char y;
	if(a>=65&&a<=90)y=a+32;
	else y=a;
	return (y);
}
int main()
{
    char z(char a);
	char a[100],b[100],c[100],d[100];
	int x,y,i;
	gets(a);
	gets(b);
	x=strlen(a);y=strlen(b);
	for(i=0;i<=x;i++)c[i]=z(a[i]);
	for(i=0;i<=y;i++)d[i]=z(b[i]);

	if(strcmp(c,d)<0)printf("<");
	else if(strcmp(c,d)==0)printf("=");
	 else printf(">");
   return 0;
}


void main()
{char str1[80],str2[80];
int n1,n2,i;
gets(str1);
n1=strlen(str1);
for(i=0;i<n1;i++)
{if(str1[i]>='A'&&str1[i]<='Z')
str1[i]=str1[i]+32;
}
gets(str2);
n2=strlen(str2);
for(i=0;i<n2;i++)
{if(str2[i]>='A'&&str2[i]<='Z')
str2[i]=str2[i]+32;
}
if(strcmp(str1,str2)>0)
{printf(">");}
else if(strcmp(str1,str2)<0)
{printf("<");}
else if(strcmp(str1,str2)==0)
{printf("=");}
}


int main()
{
	int n,i,j,flag=0;
	char a[82],b[82];
	gets(a);gets(b);
	i=0;j=0;
	while(i<strlen(a)&&j<strlen(b))
	{
		a[i]=a[i]>='A'&&a[i]<='Z'?a[i]+32:a[i];
		b[j]=b[j]>='A'&&b[j]<='Z'?b[j]+32:b[j];
		if(a[i]==b[j])
		{
			i++;
			j++;
		}
		else if(a[i]>b[j])
		{
			cout<<">"<<endl;
			flag=1;
			break;
		}
		else if(a[i]<b[j])
		{
			cout<<"<"<<endl;
			flag=1;
			break;
		}
	}
	if(flag==0)
	{
	if(strlen(a)==strlen(b)) cout<<"="<<endl;
	else if(strlen(a)>strlen(b)) cout<<">"<<endl;
	else cout<<"<"<<endl;
	}
	return 0;
}


int main()
{
	char A[81]={0},B[81]={0};
	int i,t;
	gets(A);
	gets(B);
	for(i=0;i<strlen(A);i++)
	{
		if(A[i]>='a'&&A[i]<='z')
		{

			A[i]=A[i]-32;
		}
	}
	for(i=0;i<strlen(B);i++)
	{
		if(B[i]>='a'&&B[i]<='z')
		{

			B[i]=B[i]-32;
		}
	}
	//printf("%s %s",A,B);
	if(strlen(A)<strlen(B))
		t=strlen(A);
	else
		t=strlen(B);

	for(i=0;i<t;i++)
	{
		if(A[i]>B[i])
		{
			printf(">");
			return 0;

		}
		if(A[i]<B[i])
			{
				printf("<");
				return 0;
			}
	}
	if(strlen(A)==strlen(B))
	{
		printf("=");
		return 0;
	}
		if(strlen(A)<strlen(B))
			printf("<");
			else
				printf(">");

	return 0;
}


int main(){
	 int m,n,max;
     char p[80],q[80];
	 gets(p);
	 gets(q);
     m=strlen(p);
	 n=strlen(q);
	 if(m>n)  max=m;
	 else max=n;
	 for(int i=0;i<max;i++)
	 {
	      if(p[i]>='a'&&p[i]<='z')
			  p[i]=p[i]-32;
	 }
     for(int j=0;j<max;j++)
	 {
	      if(q[j]>='a'&&q[j]<='z')
			  q[j]=q[j]-32;
	 }
	 int a=strcmp(p,q);
	     if(a>0)printf(">");
		 else if(a<0)printf("<");
		 else if(a==0)printf("=");
	 return 0;
}


/*
 *  Main.cpp
 *
 *  Created on: 2010-11-5
 *      Author: 10010
 */

int main()
{
	void change(char str[]);				//??????
	char str_1[80],str_2[80];

	cin.getline(str_1,80);					//????
	cin.getline(str_2,80);

	change(str_1);							//????
	change(str_2);

	switch(strcmp(str_1,str_2))				//switch????
	{
	case 0:cout<<'=';break;
	case -1:cout<<'<';break;
	case 1:cout<<'>';break;
	}

	return 0;
}

void change(char str[])
{
	int i,t;
	t=strlen(str);
	for(i=0;i<t;i++)						 //???? ?????????????
		if(str[i]>='A'&&str[i]<='Z')
			str[i]-='A'-'a';
}


int main()
{
	int str1len,str2len,i;
	char str1[101],str2[101];
	cin.getline(str1,101);
	cin.getline(str2,101);
	str1len=strlen(str1);
	str2len=strlen(str2);
	for(i=0;i<=str1len;i++)
	{
		if((int)str1[i]>=97)
		{
			str1[i]=(int)str1[i]-32;
		}
	}
	for(i=0;i<=str2len;i++)
		{
			if((int)str2[i]>=97)
			{
				str2[i]=(int)str2[i]-32;
			}
		}
	if(strcmp(str1,str2)==0) cout<<"=";
	if(strcmp(str1,str2)==-1) cout<<"<";
	if(strcmp(str1,str2)==1) cout<<">";
	return 0;
}


char change(char x)
 {if (x>64&&x<91) return(x+32);
  else return x;
  }

int main()
{char a[81],b[81],i;
 cin.getline(a,81);
 cin.getline(b,81);
 i=0;
for(;;)
 {if(change(a[i])>change(b[i])) {cout<<'>';break;}
  else if(change(a[i])<change(b[i])) {cout<<'<';break;}
  else if(a[i]!='\0') i++;
  else {cout<<'=';break;}
  }
 return 0;
}


int main()
{
	char change(char c);
	char str1[100],str2[100];
	int k1,k2,k,i;
	gets(str1);
	gets(str2);
	k1=strlen(str1);
	k2=strlen(str2);
	k=(k1<k2)?k1:k2;
	for(i=0;i<k1;i++)
		str1[i]=change(str1[i]);
	for(i=0;i<k2;i++)
		str2[i]=change(str2[i]);
	i=0;
	while(i<k)
	{
		if(str1[i]==str2[i])
			i++;
		else
		{
			if(str1[i]>str2[i])
				printf(">\n");
			else printf("<\n");
			break;
		}
	}
	if((i==k)&&(k1==k)&&(k1!=k2))
		printf("<\n");
	if((i==k)&&(k2==k)&&(k1!=k2))
		printf(">\n");
	if((i==k)&&(k1==k2))
		printf("=\n");
	return 0;
}
char change(char c)
{
	if((c>='A')&&(c<='Z'))
		c=c+'a'-'A';
	return(c);
}


void main()
{
	char ch1[100],ch2[100];
	gets(ch1);
	int L1=strlen(ch1);
	gets(ch2);
	int L2=strlen(ch2);
	int i;
	for(i=0;i<L1;i++)
	{
		if(ch1[i]<='Z'&&ch1[i]>='A')
			ch1[i]=ch1[i]-'A'+'a';
	}
	for(i=0;i<L2;i++)
	{
		if(ch2[i]<='Z'&&ch2[i]>='A')
			ch2[i]=ch2[i]-'A'+'a';
	}

	int judge=strcmp(ch1,ch2);
	if(judge<0)
		printf("<");
	else if(judge>0)
		printf(">");
	else if(judge==0)
		printf("=");
}


char a[80],b[80];
int n,m;
int i,j;

/*

int min(int x,int y)
{
    if(x>y) return y;
    return x;
}

char compare()
{
    int l=min(n,m);
    for(int i=0;i<l;i++)
    {
        if (lower(a[i])<lower(b[i])) return '<';
        if (lower(a[i])>lower(b[i])) return '>';
    }
    if (n<m) return '<';
    if (n>m) return '>';
    return '=';
}*/

char lower(char x)
{
    if(x>='A' && x<='Z')
        return x+'a'-'A';
    return x;
}

char tochar(int m)
{
   if(m>0)  return '>';
   if(m<0)  return '<';
   return '=';
}

void toLowerArray(char x[],int len)
{
    for(int j=0;j<len;j++)
        x[j]=lower(x[j]);
}

int main()
{
    gets(a);
    gets(b);
    n=strlen(a);
    m=strlen(b);

    toLowerArray(a,n);
    toLowerArray(b,m);

    cout<<tochar(strcmp(a,b));
    //cout<<compare();
    return 0;
}


void main()
{
  char ca[80],cb[80];
  int i,na,nb,n,b=0;
  gets(ca);
  gets(cb);
  na=strlen(ca);
  nb=strlen(cb);
  n=(na>nb?na:nb);
  for(i=0;i<n;i++)
    {
      if((ca[i]>=65)&&(ca[i]<=90))
        ca[i]=ca[i]+32;
      if((cb[i]>=65)&&(cb[i]<=90))
        cb[i]=cb[i]+32;
    }
  if(strcmp(ca,cb)>0) printf(">");
  else if(strcmp(ca,cb)<0) printf("<");
  else printf("=");
}


int main()
{
	char str1[90],str2[90];
	int i,m,n,s=0;
	gets(str1); gets(str2);
	m=strlen(str1);n=strlen(str2);
	for(i=0;i<m;i++)
	{
		if(str1[i]>='a') str1[i]=str1[i]-'a'+'A';
		if(str2[i]>='a') str2[i]=str2[i]-'a'+'A';
		if(str1[i]>str2[i]) { printf(">"); s+=1; break;}
		if(str1[i]<str2[i]) { printf("<"); s+=1; break;}
	}
	if(!s) printf("=");
}


void main()
{
	char a[100],b[100];
	char g,h;
	int i,n1,n2;
	gets(a);
	gets(b);
	n1=strlen(a);
	n2=strlen(b);

	for(i=0;i<n1;i++)
	{
		g=a[i];
		if(g<97)
		{
			g=g+32;
			a[i]=g;
		}
	}
	for(i=0;i<n2;i++)
	{
		h=b[i];
		if(h<97)
		{
			h=h+32;
			b[i]=h;
		}
	}
	if(strcmp(a,b)==0)
		printf("=");
	else if(strcmp(a,b)<0)
		printf("<");
	else if(strcmp(a,b)>0)
		printf(">");
}


int main(int argc, char* argv[])
{
	char s[81],m[81];
	gets(s);
	gets(m);
	int a, b, i;
	a=strlen(s);
	b=strlen(m);
	for(i=0;i<a;i++){
		if(s[i]>='a'&&s[i]<='z')
			s[i]=s[i]-32;
	}
	for(i=0;i<b;i++){
		if(m[i]>='a'&&m[i]<='z')
			m[i]=m[i]-32;
	}
	int c,k=0;
	if(a>=b)
		c=a;
	else
		c=b;
	for(i=0;i<c;i++){
		if(s[i]>m[i]){
			printf(">");
			break;
		}
		else if(s[i]<m[i]){
			printf("<");
			break;
		}
		k++;
	}
	if(k==c)
		printf("=");
	return 0;
}


int max(int,int);
int main()
{
	int i,n,len1,len2;
	char str1[100],str2[100];
	cin.getline(str1,1000);
	cin.getline(str2,1000);
    len1 = strlen(str1);
	len2 = strlen(str2);
    n = max(len1,len2);
	for(i = 0; i < n; i++)
	{
		if(str1[i] >= 'a')
			str1[i] -= 32;
		if(str2[i] >= 'a')
			str2[i] -= 32;
		if(str1[i] != str2[i])
		{
			if(str1[i] > str2[i])
			{
				cout << ">";
				break;
			}
			if(str1[i] < str2[i])
			{
				cout << "<" ;
				break;
			}
		}
	}
	if(i == n)
		cout << "=";
	return 0;
}
int max(int a,int b)
{
	if(a >= b)
		return a;
	if(a < b)
		return b;
}


int main()
{
	char a[80],b[80];
	gets(a);
	gets(b);
	int i;
	int m,n;
	int e;
	e=1;
	m=strlen(a);
	n=strlen(b);
	if(m<n)
		m=n;
	for(i=0;i<m;i++)
	{
		if(a[i]<91)
			a[i]+=32;
		if(b[i]<91)
			b[i]+=32;
		if(a[i]>b[i])
		{
			printf(">");
			e--;
			break;
		}
		else if(a[i]<b[i])
		{
			printf("<");
			e--;
			break;
		}
	}
	if(e)
		printf("=");
	return 0;
}


/*
 * 30.cpp
 *
 *  Created on: 2010-11-9
 *      Author: l000012910
 */
int main(){
	int k=0,i;//
	char a[80],b[80];//?????????
	cin.getline(a,80);//
	cin.getline(b,80);//??????
	for(i=0;i<80;i++)
	{
		switch(b[i]){
		case 'a':b[i]='A';break;
		case 'b':b[i]='B';break;
		case 'c':b[i]='C';break;
		case 'd':b[i]='D';break;
		case 'e':b[i]='E';break;
		case 'f':b[i]='F';break;
		case 'g':b[i]='G';break;
		case 'h':b[i]='H';break;
		case 'i':b[i]='I';break;
		case 'j':b[i]='J';break;
		case 'k':b[i]='K';break;
		case 'l':b[i]='L';break;
		case 'm':b[i]='M';break;
		case 'n':b[i]='N';break;
		case 'o':b[i]='O';break;
		case 'p':b[i]='P';break;
		case 'q':b[i]='Q';break;
		case 'r':b[i]='R';break;
		case 's':b[i]='S';break;
		case 't':b[i]='T';break;
		case 'u':b[i]='U';break;
		case 'v':b[i]='V';break;
		case 'w':b[i]='W';break;
		case 'x':b[i]='X';break;
		case 'y':b[i]='Y';break;
		case 'z':b[i]='Z';break;
		default:continue;}//???????????????

	}
	for(i=0;i<80;i++)
		{
			switch(a[i]){
			case 'a':a[i]='A';break;
			case 'b':a[i]='B';break;
			case 'c':a[i]='C';break;
			case 'd':a[i]='D';break;
			case 'e':a[i]='E';break;
			case 'f':a[i]='F';break;
			case 'g':a[i]='G';break;
			case 'h':a[i]='H';break;
			case 'i':a[i]='I';break;
			case 'j':a[i]='J';break;
			case 'k':a[i]='K';break;
			case 'l':a[i]='L';break;
			case 'm':a[i]='M';break;
			case 'n':a[i]='N';break;
			case 'o':a[i]='O';break;
			case 'p':a[i]='P';break;
			case 'q':a[i]='Q';break;
			case 'r':a[i]='R';break;
			case 's':a[i]='S';break;
			case 't':a[i]='T';break;
			case 'u':a[i]='U';break;
			case 'v':a[i]='V';break;
			case 'w':a[i]='W';break;
			case 'x':a[i]='X';break;
			case 'y':a[i]='Y';break;
			case 'z':a[i]='Z';break;
			default:continue;}
		}//?????????????
k=strcmp(a,b);//?k???k=1?????-1??a?b.1??a?b
if(k==0)
	cout<<"="<<endl;
else if(k==1)
	cout<<">"<<endl;
else if(k==-1)
	cout<<"<"<<endl;//????
return 0;
}


void main()
{
char a[100],b[100];
int c[100],d[100],sumc=0,sumd=0,lena,lenb,i;
gets(a);
gets(b);
lena=strlen(a);
lenb=strlen(b);
for(i=0;i<lena;i++)
   {c[i]=a[i];
    d[i]=b[i];
	if(c[i]>64&&c[i]<91) c[i]=c[i]+32;
	else if(d[i]>64&&d[i]<91) d[i]=d[i]+32;
	sumc=sumc+c[i];
	sumd=sumd+d[i];
   }
if(sumc>sumd)
 printf(">");
else if(sumc<sumd)
 printf("<");
else if(sumc==sumd)
 printf("=");
}


int main()
{
	char sen1[81],sen2[80];
	cin.getline(sen1,80);
	cin.getline(sen2,80);//?????
	int n = strlen(sen1), m = strlen(sen2);
	for (int i = 0; i < n; i++) sen1[i] = tolower(sen1[i]);
	for (int i = 0; i < m; i++) sen2[i] = tolower(sen2[i]);//?????
	puts(strcmp(sen1,sen2)==0?"=":(strcmp(sen1,sen2)>0?">":"<"));//???????
	return 0;
}


int min(int x,int y)
{
    return (x<y?x:y);
}
int main()
{
    char ans='=';
    char str1[90],str2[90];
    cin.getline(str1,90);
    cin.getline(str2,90);
    int x='a'-'A';
    int len1=strlen(str1);
    int len2=strlen(str2);
    for(int i=0;i<min(len1,len2);i++)
    {if(str1[i]>='a'&&str1[i]<='z') str1[i]=str1[i]-x;
      if(str2[i]>='a'&&str2[i]<='z') str2[i]=str2[i]-x;

      if(str1[i]>str2[i])  {ans='>'; break;}

     else if(str2[i]>str1[i])  {ans='<'; break;}}
    cout<<ans<<endl;

    return 0;
}


int main()
{
    char a[80],b[80];
    gets(a);
    gets(b);
    int lena=strlen(a);
    int lenb=strlen(b);
    int f=1;
    for(int i=0;i<lena;i++)
    {
        if(a[i]>='a') a[i]-=32;
        if(b[i]>='a') b[i]-=32;
        if(a[i]>b[i])
        {
            cout << '>';
            f=0;
            break;
        }
        else if(a[i]<b[i])
        {
            cout << '<';
            f=0;
            break;
        }
    }
    if(f&&lena==lenb)cout << '=';
    else if(f&&lena>lenb) cout <<'>';
    else if(f&&lena<lenb) cout <<'<';
}


int main(int argc, char* argv[])
{
	char strf[80],strs[80];
	int lf,ls,i;
	gets(strf);gets(strs);
	lf=(int)(strlen)(strf);
	ls=(int)(strlen)(strs);
	for(i=0;i<lf;i++)
	{
		if((strf[i]>='A')&&(strf[i]<='Z'))
		{
			strf[i]=strf[i]-'A'+'a';
		}
	}
    for(i=0;i<ls;i++)
	{
		if((strs[i]>='A')&&(strs[i]<='Z'))
		{
			strs[i]=strs[i]-'A'+'a';
		}
	}

	if (strcmp(strf,strs)<0)
	{
		printf("<");
	}
	else if (strcmp(strf,strs)>0)
	{
		printf(">");
	}
    else if (strcmp(strf,strs)==0)
	{
		printf("=");
	}
	return 0;
}


main()
{
	int k,i;
	char str1[80],str2[80];
	gets(str1);
	gets(str2);
for(i=0;str1[i]!='\0';i++)
 str1[i]=toupper(str1[i]);
for(i=0;str2[i]!='\0';i++)
 str2[i]=toupper(str2[i]);
if(strcmp(str1,str2)==0) k=0;
if(strcmp(str1,str2)>0) k=1;
if(strcmp(str1,str2)<0) k=-1;
	if(k==0) printf("=\n");
	else if(k==1) printf(">\n");
	else if(k==-1) printf("<\n");
}


int main()
{
	char a[81],b[81];
	cin.getline(a,81);
	cin.getline(b,81);
	for(int i=0;i<strlen(a);i++)
	{
		if(a[i]>=97) a[i]=a[i]-32;
		}
	for(int i=0;i<strlen(b);i++)
		{
			if(b[i]>=97) b[i]=b[i]-32;
	}
	if(strcmp(a,b)<0) cout<<"<"<<endl;
	else if(strcmp(a,b)>0) cout<<">"<<endl;
	else cout<<"="<<endl;
	return 0;
}


void main()
{
  char s1[100],s2[100];
  int length1,i,length2;
  gets(s1);
  gets(s2);
  length1=strlen(s1);
  for(i=0;i<length1;i++)
    if(s1[i]>='A'&&s1[i]<='Z')
	   s1[i]=s1[i]+32;
 length2=strlen(s2);
 for(i=0;i<length2;i++)
    if(s2[i]>='A'&&s2[i]<='Z')
	   s2[i]=s2[i]+32;
if(strcmp(s1,s2)>0)
  printf(">");
else if(strcmp(s1,s2)<0)
  printf("<");
else printf("=");
}


int main()
{
    char s[80],p[80] ;
    int length,i,t;
	gets(s);
	gets(p);
    length=strlen(s);
    for(i=0;i<length;i++)
	{
		if(s[i]<='z' && s[i]>='a')
        s[i]-=32;
    }
	length=strlen(p);
	 for(i=0;i<length;i++)
	{
		if(p[i]<='z' && p[i]>='a')
        p[i]-=32;
    }
	 t=strcmp(s,p);
	if(t==1)
		printf(">\n");
	if(t==-1)
		printf("<\n");
	if(t==0)
		printf("=\n");
	return 0;
}


char change(char a)
{
	if(a>='a'&&a<='z') a=a-'a'+'A';
	return a;
}
int main()
{
	int len1,len2;
	int a,b,c=0;
	char s1[85],s2[85];
	gets(s1);
	gets(s2);
	len1=strlen(s1);
	len2=strlen(s2);
	for(b=0;b<len1;b++)
	{
		s1[b]=change(s1[b]);
	}
	for(b=0;b<len2;b++)
	{
		s2[b]=change(s2[b]);
	}
	for(b=0;b<len1&&b<len2;b++)
	{
		if(s1[b]>s2[b])
		{
			printf(">");
			c=1;
			break;
		}
		else if(s1[b]<s2[b])
		{
			printf("<");
			c=1;
			break;
		}
	}
	if(c==0) printf("=");
}


int main()
{
	long l1,l2,i;
	char s[80],t[80];
	gets(s);gets(t);l1 = strlen(s);l2 = strlen(t);
   for (i=0; i<(l1+l2)/2; i++)
   {
	   s[i]=toupper(s[i]);t[i]=toupper(t[i]);
   }
   if(strcmp(s,t)==0)printf("=\n");
   if(strcmp(s,t)>0)printf(">\n");
   if(strcmp(s,t)<0)printf("<\n");
   return 0;
}


int min(int a,int b);
int main()
{
	int i,t=0,na,nb;
	char a[80],b[80];
	cin.getline(a,80,'\n');
	cin.getline(b,80,'\n');
	for(i=0;i<80;i++)
	{
		if(a[i]=='\n')
			na=i;
		else
			if(a[i]<91)
				a[i]+=32;
	}
	for(i=0;i<80;i++)
	{
		if(b[i]=='\n')
			nb=i;
		else
			if(b[i]<91)
				b[i]+=32;
	}
	for(i=0;i<5;i++)
	{
		if(a[i]<b[i])
		{
			cout<<"<"<<endl;
			t=1;
			break;
		}
		if(a[i]>b[i])
		{
			cout<<">"<<endl;
			t=1;
			break;
		}
	}
	if(t==0)
		cout<<"="<<endl;
	return 0;
}

int min(int a,int b)
{
	if(a<=b)
		return a;
	else
		return b;
}


char trans(char k)
{
	if((k>='a')&&(k<='z'))
		return(k+'A'-'a');
	else return(k);
}

main()
{
	char a[100],b[100];
	int i,l1,l2,n=0;

	gets(a);
	gets(b);
	l1=strlen(a);l2=strlen(b);

	for(i=0;(i<l1)&&(i<l2);i++){
		a[i]=trans(a[i]);
		b[i]=trans(b[i]);
		if(a[i]!=b[i])
		{
				if(a[i]>b[i]) printf(">");
				else printf("<");
				n++;
				break;
		}
	}

	if(n==0)
		printf("=");
}


char change(char c){
    if('A'<=c&&c<='Z')return c-'A'+'a';
    return c;
}
char f(char a[],int la,char b[],int lb){
    for(int i=0;i<la&&i<lb;i++){
         a[i]=change(a[i]);b[i]=change(b[i]);
         if(a[i]!=b[i]){
      if(a[i]<b[i])return '<';
      if(a[i]>b[i])return '>';
               }
        }
    return '=';
}
int main(){
    char a[100],b[100];
    gets(a);gets(b);
    int la,lb;
    la=strlen(a);lb=strlen(b);
    printf("%c",f(a,la,b,lb));
     return 0;
}


int main()
{
	char a[100];
	char b[100];
	int i,j,al,bl,k,q;
	gets(a);
		gets(b);
	al=strlen(a);bl=strlen(b);
	for(i=0;i<al;i++)
		if(a[i]>='a'&&a[i]<='z')
			a[i]-=32;
	for(j=0;j<bl;j++)
			if(b[j]>='a'&&b[j]<='z')
				b[j]-=32;

	if (al<bl)k=bl;
	else k=al;
			for(q=0;q<k;q++)
			{
				if(a[q]<b[q])
				{printf("<");break;}
			    if(a[q]>b[q])
				{printf(">");break;}

			}
			if(q==k)printf("=");
			return 0;

}


int lwr(char *a)
{
	for(;*a!='\0';a++){

		switch(*a){
		case 'A':*a='a';break;
		case 'B':*a='b';break;
		case 'C':*a='c';break;
		case 'D':*a='d';break;
		case 'E':*a='e';break;
		case 'F':*a='f';break;
		case 'G':*a='g';break;
		case 'H':*a='h';break;
		case 'I':*a='i';break;
		case 'J':*a='j';break;
		case 'K':*a='k';break;
		case 'L':*a='l';break;
		case 'M':*a='m';break;
		case 'N':*a='n';break;
		case 'O':*a='o';break;
		case 'P':*a='p';break;
		case 'Q':*a='q';break;
		case 'R':*a='r';break;
		case 'S':*a='s';break;
		case 'T':*a='t';break;
		case 'U':*a='u';break;
		case 'V':*a='v';break;
		case 'W':*a='w';break;
		case 'X':*a='x';break;
	    case 'Y':*a='y';break;
        case 'Z':*a='z';break;
		}
	}
	return 0;
}

int main(int argc, char* argv[])
{
	char str1[82],str2[82],chu;
	int a;
	gets(str1);
	gets(str2);
	lwr(str1);
	lwr(str2);
    a=strcmp(str1,str2);
	if(a>0)chu='>';
	else if(a<0)chu='<';
	else chu='=';
	printf("%c\n",chu);
	return 0;
}


int main(int argc, char *argv[])
{
  char str1[Len],str2[Len];
  char *p,*q;
  int L1,L2,flag=0;

  gets(str1);
  gets(str2);
  L1=strlen(str1);
  L2=strlen(str2);

  for(p=str1,q=str2;p<=str1+L1 && q<=str2+L2;p++,q++)
    {
      if(*p>='a' && *p<='z')
        *p=(char)((int)*p-32);
      if(*q>='a' && *q<='z')
        *q=(char)((int)*q-32);

      if(*p==*q)
        continue;
      else if(*p<*q)
        {
          flag=1;
          break;
        }
      else
        {
          flag=-1;
          break;
        }
     }
   if(flag==0)
     printf("=");
   else if(flag==1)
     printf("<");
   else
     printf(">");

  return 0;
}


int main()
{char str1[50],str2[50];
int i,j;
 gets(str1);
 gets(str2);
 for(i=0;i<50;i++){
	 switch(str1[i]){
	 case'A':str1[i]='a';break;
     case'B':str1[i]='b';break;
	 case'C':str1[i]='c';break;
	 case'D':str1[i]='d';break;
	 case'E':str1[i]='e';break;
	 case'F':str1[i]='f';break;
	 case'G':str1[i]='g';break;
	 case'H':str1[i]='h';break;
	 case'I':str1[i]='i';break;
	 case'J':str1[i]='j';break;
	 case'K':str1[i]='k';break;
	 case'L':str1[i]='l';break;
	 case'M':str1[i]='m';break;
	 case'N':str1[i]='n';break;
	 case'O':str1[i]='o';break;
	 case'P':str1[i]='p';break;
	 case'Q':str1[i]='q';break;
	 case'R':str1[i]='r';break;
	 case'S':str1[i]='s';break;
	 case'T':str1[i]='t';break;
	 case'U':str1[i]='u';break;
	 case'V':str1[i]='v';break;
	 case'W':str1[i]='w';break;
	 case'X':str1[i]='x';break;
     case'Y':str1[i]='y';break;
	 case'Z':str1[i]='z';break;
	 }
 }
 for(j=0;j<50;j++){
	 switch(str2[j]){
	 case'A':str2[j]='a';break;
	 case'B':str2[j]='b';break;
	 case'C':str2[j]='c';break;
	 case'D':str2[j]='d';break;
	 case'E':str2[j]='e';break;
	 case'F':str2[j]='f';break;
	 case'G':str2[j]='g';break;
	 case'H':str2[j]='h';break;
	 case'I':str2[j]='i';break;
	 case'J':str2[j]='j';break;
	 case'K':str2[j]='k';break;
	 case'L':str2[j]='l';break;
     case'M':str2[j]='m';break;
	 case'N':str2[j]='n';break;
	 case'O':str2[j]='o';break;
	 case'P':str2[j]='p';break;
	 case'Q':str2[j]='q';break;
	 case'R':str2[j]='r';break;
	 case'S':str2[j]='s';break;
	 case'T':str2[j]='t';break;
	 case'U':str2[j]='u';break;
	 case'V':str2[j]='v';break;
	 case'W':str2[j]='w';break;
	 case'X':str2[j]='x';break;
	 case'Y':str2[j]='y';break;
	 case'Z':str2[j]='z';break;
	 }
 }
 i=strcmp(str1,str2);
 if(i==0){
	 printf("=\n");
 }
 if(i<0){
	 printf("<\n");
 }
 if(i>0){
	 printf(">\n");
 }
	return 0;
}


int main()
{
	char str1[100],str2[100];
	gets(str1);
	gets(str2);
	int length1,length2;
	length1=strlen(str1);
	length2=strlen(str2);
	int i;
	for(i=0;i<length1;i++)
	{
		if(str1[i]<='z' && str1[i]>='a')
        str1[i]-='a'-'A';
	}
	for(i=0;i<length2;i++)
	{
		if(str2[i]<='z' && str2[i]>='a')
        str2[i]-='a'-'A';
	}
	if(strcmp(str1,str2)>0)
		printf(">\n");
	if(strcmp(str1,str2)<0)
		printf("<\n");
	if(strcmp(str1,str2)==0)
		printf("=\n");
	return 0;
}


int main()
{
	int i, al, bl;
	char a[100],b[100];
	gets(a);
	gets(b);
	al = strlen(a);
	bl = strlen(b);
	for(i=0;i<al;i++){
		if(a[i]>='a'&&a[i]<='z')
			a[i] = (char)((int)a[i]-32);
	}
	for(i=0;i<bl;i++){
		if(b[i]>='a'&&b[i]<='z')
			b[i] = (char)((int)b[i]-32);
	}
	if(strcmp(a,b)==0)
		printf("=");
	else if(strcmp(a,b)>0)
		printf(">");
	else
		printf("<");
	return 0;
}


int main()
{
	char a[30],b[30];
	int i,j,num1,num2;
	gets(a);
	gets(b);
	num1=strlen(a);
	num2=strlen(b);
	for(i=0;i<num1;i++)
	{
		if(a[i]<='z'&&a[i]>='a')
		    a[i]-=32;
	}
    for(i=0;i<num2;i++)
	{
		if(b[i]<='z'&&b[i]>='a')
		    b[i]-=32;
	}
		if(strcmp(a,b)>0)
			printf(">");
		else if(strcmp(a,b)<0)
			printf("<");
	    else
		printf("=");
	return 0;
}


int main()
{
   int i,num=0,l1,l2;
   char str1[80],str2[80];
   gets(str1);
   gets(str2);
   l1=strlen(str1);
   l2=strlen(str2);
   for(i=0;i<l1;i++)
   {        if(str1[i]>='A' && str1[i]<='Z') str1[i]=str1[i]+32;
            if(str2[i]>='A' && str2[i]<='Z') str2[i]=str2[i]+32;

          if(str1[i]==str2[i])
         {num++;continue;}
      else if(str1[i]<str2[i]) {cout<<'<'; break;}
      else if(str1[i]>str2[i]) {cout<<'>';break;}

  }if(num==l1) cout<<'=';
 return 0;

}


int  main()
{
	char a[81]={0};
	char b[81]={0};
	gets(a);
	gets(b);
	int len1=strlen(a);
	int len2=strlen(b);
	for(int i=0;i<len1;i++)
		a[i]=toupper(a[i]);
	for(int i=0;i<len2;i++)
		b[i]=toupper(b[i]);
	if(strcmp(a,b)>0)
	   printf("%c",'>');
	else
	   if(strcmp(a,b)<0)
	      printf("%c",'<');
	   else
	      printf("%c",'=');
}


void main()
{ char str1[80];char str2[80];int i;
gets(str1);gets(str2);
for(i=0;i<80;i++)
   {if(str1[i]>=97) str1[i]=str1[i]-32;}
for(i=0;i<80;i++)
   {if(str2[i]>=97) str2[i]=str2[i]-32;}
if(strcmp(str1,str2)>0) { printf(">");}
else if(strcmp(str1,str2)<0)  {printf("<");}
else printf("=");
}


int main(int argc, char* argv[])
{
	char a[80],b[80];
	gets(a);
	gets(b);
	int i,la,lb;
	la=strlen(a);
	lb=strlen(b);
	for(i=0;i<la;i++)
	{
		if(a[i]<'a'&&a[i]>='A')
			a[i]=(char)a[i]+32;
	}
	for(i=0;i<lb;i++)
	{
		if(b[i]<'a'&&b[i]>='A')
			b[i]=(char)b[i]+32;
	}
	if(strcmp(a,b)>0)
		printf(">");
	else if(strcmp(a,b)==0)
		printf("=");
    else if(strcmp(a,b)<0)
		printf("<");

	return 0;
}


daxie(char s[])
{
	int len;
	int i,j;
	len=strlen(s);
	for(i=0;i<len;i++)
		if(s[i]>='A'&&s[i]<='Z') s[i]=s[i]+'a'-'A';
	return;
}

main()
{
	char s1[90],s2[90];
	int c;

	gets(s1);
	gets(s2);

	daxie(s1);
	daxie(s2);

	c=strcmp(s1,s2);
	if(c==-1) printf("<");
	if(c==0)  printf("=");
	if(c==1) printf(">");
}


void trans(char a[])
{
     int i;
     for (i=0;i<=strlen(a)-1;i++)
     {
         if (a[i]>='A'&&a[i]<='Z')
            a[i]=a[i]+32;
         }
}

int main(int argc, char *argv[])
{
  char a[80],b[80];
  gets(a);
  gets(b);
  trans(a);
  trans(b);
  int i,j,flag=1;
  for (i=0,j=0;i<=strlen(a)-1&&j<=strlen(b)-1;i++,j++)
  {
      if (a[i]<b[j])
      {
         printf("<");
         flag=0;
         break;
      }
      else if (a[i]>b[j])
      {
           printf(">");
           flag=0;
           break;
      }
  }
  if (flag==1)
  printf("=");
  return 0;
}


void main()
{
	char a[80],b[80];
	int i,m,n,t,p=1;
	gets (a);
	gets (b);
    m=strlen (a);
	n=strlen (b);
	t=(m>n)?m:n;
	for (i=0;i<t;i++)
	{
		if (a[i]>96) a[i]=a[i]-32;
		if (b[i]>96) b[i]=b[i]-32;
		if (a[i]>b[i]) {printf (">");p=0;break;}
		else if (a[i]<b[i]) {printf ("<");p=0;break;}
	}
    if (p)
		if (m>n) printf (">");
		else if (m=n) printf("=");
		     else printf ("<");
}


//??????????
int main()
{
	char a[80],b[80];//???????
	int i=0,j=0,lena=0,lenb=0,min=0;
	cin.getline(a,80);
	cin.getline(b,80);
	for(i=0;a[i]!='\0';i++)
	{
		if(a[i]>='a' && a[i]<='z')
			a[i]=a[i]-32;
	}
	for(i=0;b[i]!='\0';i++)
	{
		if(b[i]>='a' && b[i]<='z')
			b[i]=b[i]-32;
	}
	lena=strlen(a);lenb=strlen(b);
	if(lena<lenb)
		min=lena;
	if(lena>=lenb)
		min=lenb;
	for(i=0;i<min;i++)
		{
		    j=j+1;
			if(a[i]==b[i])
				continue;
			if(a[i]>b[i])
			{
				cout<<">"<<endl;break;
			}
			if(a[i]<b[i])
			{
				cout<<"<"<<endl;break;
			}
		}
		if(j==i)
		{
			if(lena>lenb)
				cout<<">"<<endl;
			if(lena<lenb)
				cout<<"<"<<endl;
			if(lena==lenb)
			    cout<<"="<<endl;
		}

	return 0;
}


int main(int argc, char* argv[])
{char a[81],b[81];
int i,j,n,m,p,r,x;
gets(a);
gets(b);
n=strlen(a);
p=strlen(b);
for(i=0;i<n;i++){
	m=(int)a[i];
	if(m>=97&&m<=122) {m=m-32;a[i]=(char)m;}
}
for(j=0;j<p;j++){
	r=(int)b[j];
	if(r>=97&&r<=122) {r=r-32;b[j]=(char)r;}
}
x=strcmp(a,b);
if(x>0) printf(">");
else if(x==0) printf("=");
else if(x<0) printf("<");
	return 0;
}


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


int main()
{
	char str1[81],str2[81];
	int i;
	cin.getline(str1,81);
	cin.getline(str2,81);
	for(i=0;i<strlen(str1);i++)
	{
	   if(str1[i]>=65&&str1[i]<=90)
		   str1[i]=str1[i]+32;
	}
	for(i=0;i<strlen(str2);i++)
	{
		if(str2[i]>=65&&str2[i]<=90)
			str2[i]=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;
}


char str1[80], str2[80];
int main()
{
	int i, len1, len2;
    cin.getline(str1,80,'\n');
	cin.getline(str2,80,'\n');
	len1 =strlen(str1);
	len2 =strlen(str2);
    for(i=0; i<len1; i++)
		if(str1[i]>='A' && str1[i]<='Z')
			 str1[i]+=32;
    for(i=0; i<len2; i++)
		if(str2[i]>='A' && str2[i]<='Z')
			str2[i]+=32;
	if(strcmp(str1,str2)>0)
		cout << '>';
	else if(strcmp(str1,str2)<0)
		cout << '<';
	else
		cout <<'=';
	return 0;
}


main(){
	char str1[80], str2[80];
	int i;
	gets(str1);
	gets(str2);
	for(i=0; i<80; i++){
		if(str1[i]>96) str1[i]-=32;
		else str1[i]-=0;
		if(str2[i]>96) str2[i]-=32;
		else str2[i]-=0;
	}
	if(strcmp(str1, str2)<0) printf("<");
	else if(strcmp(str1, str2)>0) printf(">");
	else printf("=");
}


int main(int argc, char* argv[])
{
 char a[30];
 char b[30];
 gets(a);
 gets(b);
 int i;
 int m,n;
 m=strlen(a);
 n=strlen(b);
 for(i=0;i<m;i++){

	 switch(a[i]){
	    case 'A': a[i]='a';break;
		case 'B': a[i]='b';break;
		case 'C': a[i]='c';break;
		case 'D': a[i]='d';break;
		case 'E': a[i]='e';break;
		case 'F': a[i]='f';break;
		case 'G': a[i]='g';break;
		case 'H': a[i]='h';break;
		case 'I': a[i]='i';break;
		case 'J': a[i]='j';break;
		case 'K': a[i]='k';break;
		case 'L': a[i]='l';break;
		case 'M': a[i]='m';break;
		case 'N': a[i]='n';break;
		case 'O': a[i]='o';break;
		case 'P': a[i]='p';break;
		case 'Q': a[i]='q';break;
		case 'R': a[i]='r';break;
		case 'S': a[i]='s';break;
		case 'T': a[i]='t';break;
		case 'U': a[i]='u';break;
		case 'V': a[i]='v';break;
		case 'W': a[i]='w';break;
		case 'X': a[i]='x';break;
		case 'Y': a[i]='y';break;
		case 'Z': a[i]='z';break;
		default:break;
	 }

 }
 for(i=0;i<n;i++){

		switch(b[i]){
	    case 'A': b[i]='a';break;
		case 'B': b[i]='b';break;
		case 'C': b[i]='c';break;
		case 'D': b[i]='d';break;
		case 'E': b[i]='e';break;
		case 'F': b[i]='f';break;
		case 'G': b[i]='g';break;
		case 'H': b[i]='h';break;
		case 'I': b[i]='i';break;
		case 'J': b[i]='j';break;
		case 'K': b[i]='k';break;
		case 'L': b[i]='l';break;
		case 'M': b[i]='m';break;
		case 'N': b[i]='n';break;
		case 'O': b[i]='o';break;
		case 'P': b[i]='p';break;
		case 'Q': b[i]='q';break;
		case 'R': b[i]='r';break;
		case 'S': b[i]='s';break;
		case 'T': b[i]='t';break;
		case 'U': b[i]='u';break;
		case 'V': b[i]='v';break;
		case 'W': b[i]='w';break;
		case 'X': b[i]='x';break;
		case 'Y': b[i]='y';break;
		case 'Z': b[i]='z';break;
		default:break;
	 }
 }
 if(strcmp(a,b)>0){
	 printf(">");
 }
 else if(strcmp(a,b)<0){
	 printf("<");
 }
 else printf("=");

	return 0;
}


void main()
{
	char strupr(char x);
	int i;
	char a[80],b[80],c[80],d[80];
	gets(a);
	gets(b);
	for(i=0;i<80;i++)
	{c[i]=strupr(a[i]);
	 d[i]=strupr(b[i]);}
	if(strcmp(c,d)>0) printf(">");
	else if(strcmp(c,d)<0) printf("<");
	else printf("=");
}
char strupr(char x)
{
	if(x>96&&x<123)
		return (x-32);
	else return (x);
}


int main()
{
	char str1[80],str2[80];
	int i;
	gets(str1);
	gets(str2);
	for(i=0;i<=79;i++)
	{
		if(65<=str1[i] && str1[i]<=90) str1[i]+=32;
		if(65<=str2[i] && str2[i]<=90) str2[i]+=32;
	}
	if(strcmp(str1,str2)==0) printf("=");
	else if(strcmp(str1,str2)>0) printf(">");
	else if(strcmp(str1,str2)<0) printf("<");
	return 0;
}


int main(int argc, char* argv[])
{
	int n,i;
	char s[100],t[100],*ps,*pt;
	char da[27]="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
	char xiao[27]="abcdefghijklmnopqrstuvwxyz";
	gets(s);
	gets(t);
	for(ps=s,pt=t;*ps!='\0',*pt!='\0';ps++,pt++)
	{
		for(i=0;i<27;i++)
		{
			if(*ps==da[i])
				*ps=xiao[i];
			if(*pt==da[i])
				*pt=xiao[i];
		}
	}
    n=strcmp(s,t);
	if(n>0)
		printf(">\n");
	if(n<0)
		printf("<\n");
	else
		printf("=\n");
	return 0;
}


int main(int argc, char* argv[])
{
	char a[81];
	char b[81];
	int c,d,i;
	gets(a);
	gets(b);
	c=strlen(a);
	d=strlen(b);
	for(i=0;i<c;i++)
	{
		if(a[i]>='a'&&a[i]<='z')
			a[i]=a[i]-32;
	}
	for(i=0;i<d;i++)
	{
		if(b[i]>='a'&&b[i]<='z')
			b[i]=b[i]-32;
	}
	if(strcmp(a,b)==1)
		printf(">");
	else if(strcmp(a,b)==-1)
		printf("<");
	else printf("=");

	return 0;
}


int main()
{
	char ch1[100],ch2[100];
	gets(ch1);
    gets(ch2);
	int i;
	int len1=strlen(ch1);
	int len2=strlen(ch2);
	int len=len1;

	if(len1>len2)
	{
		len=len2;
	}
	for( i=0;i<len1;i++)
	{
		if(ch1[i]>=65 && ch1[i]<=90)
		{
			ch1[i]=ch1[i]+32;
		}
	}
	for( i=0;i<len2;i++)
	{
		if(ch2[i]>=65 && ch2[i]<=90)
		{
			ch2[i]=ch2[i]+32;
		}
	}
	for(i=0;i<len;i++)
	{
		if(ch1[i]!=ch2[i])
		{
			if(ch1[i]>ch2[i])
			{
				cout<<">"<<endl;
				return 0;
			}
			else
			{
				cout<<"<"<<endl;
				return 0;
			}

		}
	}
	if(len1>len2)
	{
		cout<<">"<<endl;
		return 0;
	}
	if(len1<len2) {
		       cout<<"<"<<endl;
				return 0;
				}
	if(len1==len2)
	{
		cout<<"="<<endl;
	     return 0;
	}
}


void down(char *a)
{
for (int i=0;a[i]!=0;i++)
    {
    if (a[i]>='A'&&a[i]<='Z')
       a[i]=a[i]-'A'+'a';
    }
}

int main()
{
char a[100],b[100];
gets(a);
gets(b);
down(a);
down(b);
int x=strcmp(a,b);
if (x>0) putchar('>');
else if (x<0) putchar('<');
     else putchar('=');
}


void main()
{
	int n,k,len = 0;
	char str1[30],str2[30];
	gets(str1);
	gets(str2);
	len = strlen(str1);
	k=0;
	while (k>=0)
	{
		n=str1[k]-str2[k];
		k++;

		if (n==-32)
			continue;
		if (n==32)
			continue;
		if (n>32)
		{
			printf(">");
			break;
		}
		if (n<-32)
		{
			printf("<");
			break;
		}
                  if (n<0)
                  {
                            printf(">");
			break;
                   }
                   if (n>0)
                  {
                            printf("<");
			break;
                   }

		if (k==len)
		{
			printf("=");
			break;
		}
			}
}


void toLowerCase(char *s) {
	while (*s) {
		if (isupper(*s))
			*s = 'a' + *s - 'A';
		s++;
	}
}
int main() {
	char s1[128];
	char s2[128];
	gets(s1);
	gets(s2);
	toLowerCase(s1);
	toLowerCase(s2);
	int res = strcmp(s1, s2);
	if (res < 0)
		printf("<");
	else if (res == 0)
		printf("=");
	else
		printf(">");
}


int main()
{
	int flag=0,i;
	char str1[80],str2[80];
	cin.getline(str1,80);
	cin.getline(str2,80);
	for( i=0;str1[i]!='\0'&&str2[i]!='\0';i++)
	{
	    if(str1[i]<91&&str2[i]<91)
		{
			if(str1[i]<str2[i]){cout<<'<'<<endl;flag=1;break;}
			else if(str1[i]>str2[i]){cout<<'>'<<endl;flag=1;break;}
			else continue;
		}
		 if(str1[i]>91&&str2[i]<91)
		{
			 str1[i]=str1[i]-32;
			 if(str1[i]<str2[i]){cout<<'<'<<endl;flag=1;break;}
			 else if(str1[i]>str2[i]){cout<<'>'<<endl;flag=1;break;}
			 else continue;
		}
		 if(str1[i]<91&&str2[i]>91)
		{
			 str2[i]=str2[i]-32;
			if(str1[i]<str2[i]){cout<<'<'<<endl;flag=1;break;}
			else if(str1[i]>str2[i]){cout<<'>'<<endl;flag=1;break;}
			else continue;
		}if(str1[i]>91&&str2[i]>91)
		{
			if(str1[i]<str2[i]){cout<<'<'<<endl;flag=1;break;}
			else if(str1[i]>str2[i]){cout<<'>'<<endl;flag=1;break;}
			else continue;
		}

	}
	if(flag==0)
	{if(str1[i]=='\0'&&str2[i]=='\0')cout<<'='<<endl;
	else if(str1[i]!='\0')cout<<'>'<<endl;
	else cout<<'<'<<endl;}
	return 0;
}


int main()
{
    char string1[1000];
    char string2[1000];
    gets(string1);
    gets(string2);
    int i,n1,n2;
    n1=strlen(string1);
    n2=strlen(string2);
    for(i=0;i<n1;i++)
    {
                     if(string1[i]>=65&&string1[i]<=90)
                     {
                                                       string1[i]=string1[i]+32;
                     }

                     if(string2[i]>=65&&string2[i]<=90)
                     {
                                                       string2[i]=string2[i]+32;
                     }
    }
    if(strcmp(string1,string2)==0)
    {
                                  printf("=");
    }
    if(strcmp(string1,string2)>0)
    {
                                 printf(">");
    }
    if(strcmp(string1,string2)<0)
    {
                                 printf("<");

    }
    return 0;
}


int main()
{
 char str1[85],str2[85];
 cin.getline(str1,85);
 cin.getline(str2,85);
 int l = max(strlen(str1), strlen(str2));
 for(int i=0;i<l;i++)
 {
	     if(str1[i]>=65&&str1[i]<=90)
			 str1[i]=str1[i]+32;
		 if(str2[i]>=65&&str2[i]<=90)
			 str2[i]=str2[i]+32;

		 if(str1[i]>str2[i])
			{ cout<<'>';
		 return 0;}
		 else if(str1[i]<str2[i])
		 {
		 cout<<'<';
		 return 0;
		 }
		 else if(str1[i]==str2[i])
			 continue;

 }
cout<<'=';

  return 0;

}