#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;

const int maxn=+;

char s1[maxn],s2[maxn];

int a[maxn],b[maxn];

int lena,lenb;

int c;

int main()

{

    scanf("%s%s",s1,s2);

    lena=strlen(s1);

    lenb=strlen(s2);

    c=; for(int i=lena-;i>=;i--) a[c++]=s1[i]-'';

    c=; for(int i=lenb-;i>=;i--) b[c++]=s2[i]-'';

    for(int i=lena;i<max(lena,lenb);i++) a[i]=;

    for(int i=lenb;i<max(lena,lenb);i++) b[i]=;

    int flag=;

    for(int i=max(lena,lenb)-;i>=;i--)

    {

        if(a[i]!=b[i]){

            if(a[i]>b[i]) printf(">\n");

            else printf("<\n");

            flag=;

            break;

        }

    }

    if(!flag) printf("=\n");

    return ;

}