#include<iostream>
using namespace std;
int main()
{
    int v;
    cin>>v;
    double r=1000000,a;
    int digit,cost;
    for(double i=1;i<=9;i++)
    {
        cin>>a;
        if(a/i<=r)
        {
            r=a/i;
            digit=i;
            cost=a;

        }
    }
    if(v<cost)
    cout<<-1;
    else
    {
        while(v>=cost)
        {
            cout<<digit;
            v-=cost;
        }
    }
}


#include<iostream>
using namespace std;
int main()
{
    int v;
    cin>>v;
    int a[10]={0};
    a[0]=1000000;
    int min=0;
    for(int i=1;i<=9;i++)
    {
        cin>>a[i];
        if(a[i]<=a[min])min=i;
    }
    int d = v/a[min];
    if(d==0)
    cout<<-1;
    else
    {
        int no[d];
        for(int i=0;i<d;i++)
        no[i]=min;
        int b= v-d*a[min];
        int k=0;
        while(b>0)
        {
            b+=a[min];
            for(int i=9;i>min;i--)
            {
                if(b>=a[i])
                {
                    b-=a[i];
                    no[k++]=i;
                    break;
                }
                if(i==min+1)
                b=0;
            }
        }
        for(int i=0;i<d;i++)
        cout<<no[i];
    }

}


#include<iostream>
using namespace std;
int main()
{
    int v;
    cin>>v;
    int a[10]={0};
    a[0]=1000000;
    int min;
    for(int i=1;i<=9;i++)
    {
        cin>>a[i];
        if(a[i]<=a[min])min=i;
    }
    int d = v/a[min];
    if(d==0)
    cout<<-1;
    else
    {
        int no[d];
        for(int i=0;i<d;i++)
        no[i]=min;
        int b= v-d*a[min];
        int k=0;
        while(b>0)
        {
            b+=a[min];
            for(int i=9;i>min;i--)
            {
                if(b>=a[i])
                {
                    b-=a[i];
                    no[k++]=i;
                    break;
                }
                if(i==min+1)
                b=0;
            }
        }
        for(int i=0;i<d;i++)
        cout<<a[i];
    }
}


#include<iostream>
using namespace std;
int main()
{
    int v;
    cin>>v;
    int a[10]={0};
    a[0]=1000000;
    int min=0;
    for(int i=1;i<=9;i++)
    {
        cin>>a[i];
        if(a[i]<=a[min])min=i;
    }
    int d = v/a[min];
    if(d==0)
    cout<<-1;
    else
    {
        int no[d];
        for(int i=0;i<d;i++)
        no[i]=min;
        int b= v-d*a[min];
        int k=0;
        while(b>0)
        {
            b+=a[min];
            for(int i=9;i>min;i--)
            {
                if(b>=a[i])
                {
                    b-=a[i];
                    no[k++]=i;
                    break;
                }
                if(i==min+1)
                b=0;
            }
        }
        for(int i=0;i<d;i++)
        cout<<a[i];
    }

}


#define _CRT_SECURE_NO_WARNINGS

/***from dust i have come, dust i will be***/

#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<utility>
#include<vector>

typedef long long int ll;
typedef unsigned long long int ull;

#define dbg printf("in\n")
#define nl printf("\n");
#define N 200010
#define inf 100000000000
#define pp pair<int,int>

using namespace std;

bool cmp(pp a, pp b)
{
	if (a.first == b.first)
		return a.second > b.second;

	return a.first < b.first;
}

int main()
{
	freopen("in2.txt", "r", stdin);

	int i, j, k;
	int n, m, v;
	int x, y;

	map<int, int> mp;
	vector<pp> vec;

	cin >> v;
	for (i = 0; i < 9; i++)
		cin >> m, vec.push_back({ m,i + 1 }), mp[i + 1] = m;

	sort(vec.begin(), vec.end(), cmp);

	string str = "";
	while (v>0)
	{
		if (v >= vec[0].first)
			v -= vec[0].first, str.push_back(48+vec[0].second);
		else
			break;
	}

	if (str.length())
	{
		//now try replacing some of the digits
		for (i = 0; i < str.length(); i++)
		{
			k = str[i] - 48;
			x = mp[str[i] - 48];
			for (j = 9; j > k; j--)
			{
				y = mp[j];
				if (v + x - y >= 0)
				{
					v = (v + x - y);
					str[i] = j + 48;
					break;
				}
			}
		}

		cout << str << endl;
	}

	else
		cout << "-1" << endl;

	return 0;
}


#include <cstdio>

int main(){

    const int N = 10;
    long quantity[N] = {0};
    long occurence[N] = {0};

    long paint(0); scanf("%ld", &paint);
    long minQuantity(1e6), minDigit(0);

    for(int k = 1; k < N; k++){
        scanf("%ld", quantity + k);
        if(quantity[k] <= minQuantity){minQuantity = quantity[k]; minDigit = k;}
    }

    if(paint > minQuantity){

        occurence[minDigit] = paint / quantity[minDigit];
        paint %= quantity[minDigit];

        int remDigit(9);
        while(paint > 0 && remDigit > minDigit){
            long currentDiff = quantity[remDigit] - quantity[minDigit];
            occurence[remDigit] += paint / currentDiff;
            occurence[minDigit] -= paint / currentDiff;
            paint %= currentDiff;
            remDigit--;
        }

        for(int digit = N - 1; digit >= minDigit; digit--){
            for(int m = 0; m < occurence[digit]; m++){
                printf("%d", digit);
            }
        }
        puts("");
    }

    else{puts("-1");}

    return 0;
}


#include <bits/stdc++.h>using namespacestd;#defineLL Long Long#defineINF 0x3f3f3f3fintMain () {intv,a[ the];  while(~SCANF ("%d",&v)) {intm=1;  for(intI=1; i<=9; i++) {scanf ("%d",&A[i]); if(A[m]>a[i]) m=i; }        intNUM=V/A[M];//Find out the maximum number of numbers        if(num==0) puts ("-1"); Else        {             for(intI=0; i<num;i++)//cycle num times, each output can get the largest one{v%=A[m];  for(intj=9; j>=m;j--)                {                    if((A[j]-a[m]) <=v) {//If the number is less than the remaining, the outputv-= (a[j]-a[m]); printf ("%d", J);  Break; }}} printf ("\ n"); }    }    return 0;}


#include <iostream>
#include <bits/stdc++.h>

using namespace std;

int main() {
    int v;
    cin >> v;
    int c[10];
    for(int i=1;i<10;i++){
        cin >> c[i];
    }
   if(v==0){
       cout << -1;
       return 0;
   }
    pair<int,int> q[10];
    for(int i=1;i<10;i++){
        q[i].second=i;
        q[i].first=v/c[i];
    }
    sort(q+1,q+10);
    if(q[9].first==0){
        cout << -1;
        return 0;
    }
    string a;
    for(int i=0;i<q[9].first;i++){
        a.push_back(q[9].second+48);

    }
    int r=v%c[q[9].second];
    if(r==0){
        cout << a;
    }else{
        for(int i=0;i<a.length();i++){
            for(int j=9;j>0;j--){
                if(r+c[a.at(i)-48]>=c[j]){
                    r=r+c[a.at(i)-48]-c[j];
                    a.at(i)=j+48;
                    break;
                }
            }
        }
        cout << a;
    }

}


#include<bits/stdc++.h>
using namespace std;

int a[9];
string str;
int getValue(vector <int> v){

    int s=0;
    for(int j=0;j<v.size();j++){
        s=s*10+v[j];
    }

    return s;

}

string call(int i, int paint, string v){
    if(paint==0)
        return v;

    string opt1=v, opt2=v;

    if(i>0)
        opt2= call(i-1, paint, v);

    if(paint>=a[i]){
        char c= '0' + (i+1);
        v.push_back(c);
        opt1= call(i, paint-a[i], v);
    }

    if(opt1.length()==opt2.length()){
        int flag=0;
        for(int i=0;i<opt1.length();i++){

            int op1= opt1[i]-'0';
            int op2= opt2[i]-'0';

            if(op1>op2){
                flag=1;
                break;
            }
            else if(op2>op1){
                flag=2;
                break;
            }

        }

        if(flag==1)
            return opt1;
        else
            return opt2;

    }
    if(opt1.length()<opt2.length())
        return opt2;
    else
        return opt1;

    //return opt1.length()>opt2.length() ? opt1: opt2;

}

main(){
    int paint;
    cin>>paint;

    for(int i=0;i<9;i++){
        cin>> a[i];
        char c= (char) a[i];
        str.push_back(c);
    }

    string s;

    cout<< call(8,paint,s)<< endl;

}


#include <iostream>
#include <bits/stdc++.h>

using namespace std;

int c[10];

bool sor(pair <int,int> a,pair <int,int> b){
    return c[a.second]>c[b.second];
}

int main() {
    int v;
    cin >> v;

    for(int i=1;i<10;i++){
        cin >> c[i];
    }
   if(v==0){
       cout << -1;
       return 0;
   }
    pair<int,int> q[10];
    for(int i=1;i<10;i++){
        q[i].second=i;
        q[i].first=v/c[i];
    }
    sort(q+1,q+10,sor);
    if(q[9].first==0){
        cout << -1;
        return 0;
    }
    string a;
    for(int i=0;i<q[9].first;i++){
        a.push_back(q[9].second+48);

    }

    int r=v%c[q[9].second];
    if(r==0){
        cout << a;
    }else{
        for(int i=0;i<a.length()-1;i++){
            for(int j=9;j>0;j--){
                if(v-c[j]>=(a.length()-i-1)*c[q[9].second]){
                    v=v-c[j];
                    a.at(i)=j+48;
                    break;
                }
            }
        }
        cout << a;
    }

}


#include<bits/stdc++.h>
using namespace std;

int a[9];
string str;
int getValue(vector <int> v){

    int s=0;
    for(int j=0;j<v.size();j++){
        s=s*10+v[j];
    }

    return s;

}

string call(int i, int paint, string v){
    if(paint==0)
        return v;

    string opt1=v, opt2=v;

    if(i>0)
        opt2= call(i-1, paint, v);

    if(paint>=a[i]){
        char c= '0' + (i+1);
        v.push_back(c);
        opt1= call(i, paint-a[i], v);
    }

    if(opt1.length()==opt2.length()){
        int flag=0;
        for(int i=0;i<opt1.length();i++){

            int op1= opt1[i]-'0';
            int op2= opt2[i]-'0';

            if(op1>op2){
                flag=1;
                break;
            }
            else if(op2>op1){
                flag=2;
                break;
            }

        }

        if(flag==1)
            return opt1;
        else
            return opt2;

    }
    if(opt1.length()<opt2.length())
        return opt2;
    else
        return opt1;

    //return opt1.length()>opt2.length() ? opt1: opt2;

}

int main(){
    int paint;
    cin>>paint;

    for(int i=0;i<9;i++){
        cin>> a[i];
        char c= (char) a[i];
        str.push_back(c);
    }

    string s;
    string ss= call(8,paint,s);

    if(ss.empty()){
        cout << -1;
        return 0;
    }

    cout<< call(8,paint,s)<< endl;

}


#include<bits/stdc++.h>
using namespace std;
int main()
{
	long long s=0,n,min=1000001,x,mi,a[10],no,si=0;
	cin>>n;
	for (int i = 0; i < 9; ++i)
	{
		cin>>x;
		a[i]=x;
		if (x<=min)
			min=x,mi=i+1;
		if (s+x<=n)
		s+=x,si=i+1;
	}
	no=mi;
	s=si;
	if (n<min)
		cout<<-1;
	else
	{
		if ((si*(si+1))/2<=n&&n/min<=si)
		for (int i = si; i >= 1; --i)
		{
			cout<<i;
		}
	else
	for (int i = 0; i < n/min; ++i)
	{
		cout<<mi;
		//no=no*10+mi;
	}
//	cout<<no;
	//cout<<max(no,s)<<endl;
}

}


#include<bits/stdc++.h>
using namespace std;
int main()
{
	long n,min=1000001,x,mi;
	cin>>n;
	for (int i = 0; i < 9; ++i)
	{
		cin>>x;
		if (x<=min)
			min=x,mi=x;
	}
	if (n<min)
		cout<<-1;
	else
	for (int i = 0; i < n/min; ++i)
	{
		cout<<mi;
	}

}


#include<bits/stdc++.h>
using namespace std;
int main()
{
	long n,min=1000001,x,mi;
	cin>>n;
	for (int i = 0; i < 9; ++i)
	{
		cin>>x;
		if (x<=min)
			min=x,mi=i+1;
	}
	if (n<min)
		cout<<-1;
	else
	for (int i = 0; i < n/min; ++i)
	{
		cout<<mi;
	}

}


#include<bits/stdc++.h>
using namespace std;
int main()
{
	long long n,a[100001],m=10000000000000,max=0,k,l;
	cin>>n;
	for (int i = 0; i < 9; ++i)
	{
		cin>>a[i];
		if (m>a[i])
			m=a[i],k=i;
	}
	//cout<<m<<endl;
	if (m>n)
		cout<<-1;
	else if (n%m==0)
	{
		for (int i=0;i<n/m;i++)
			cout<<k+1;
	}
	else
	{
		for (int i = 0; i < 9; ++i)
		{
			if (a[i]<m+n%m&&a[i]>max)
				max=a[i],l=i;
		}
	cout<<l;
	for (int i = 0; i < n/m-1; ++i)
	{
		cout<<k;
	}
}
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
	long n,min=1000001,x,mi;
	cin>>n;
	for (int i = 0; i < 9; ++i)
	{
		cin>>x;
		if (x<min)
			min=x,mi=i+1;
	}
	if (n<min)
		cout<<-1;
	else
	for (int i = 0; i < n/min; ++i)
	{
		cout<<mi;
	}

}


#include<bits/stdc++.h>
using namespace std;
int main()
{
	long long n,a[10],s=0,min=100000000000,k,t,c;
	cin>>n;
	for ( i = 0; i < 9; ++i)
	{
		cin>>a[i];
		if (a[i]<=min)
			min=a[i],k=i;
	}
	//cout<<min<<" "<<k+1<<endl;
	if (n<min)
		cout<<-1<<endl;
	else if (n%min==0)
	{
		//cout<<"A";
		for ( i = 0; i < n/min; ++i)
		{
			cout<<k+1;
		}
	}

	else
	{
		c=n/min;
		//cout<<c<<endl;
		t=n%min;
		for ( i = 8; i >= 0;i--)
		{
			for ( j = 8; j >=0; --j)
				{
					//cout<<t+min<<endl;
					if (t+min>=a[j]&&c>0)
					{
						//cout<<"a";
						cout<<j+1;
						t=t+min-a[j];
						c--;
						break;
					}
				}
		}
		for ( i = 0; i < c; ++i)
		{
			cout<<k+1;
		}
	}
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
	long long s=0,n,min=1000001,x,mi,a[10],no,si=0;
	cin>>n;
	for (int i = 0; i < 9; ++i)
	{
		cin>>x;
		a[i]=x;
		if (x<=min)
			min=x,mi=i+1;
		if (s+x<=n)
		s+=x,si=i+1;
	}
	no=mi;
	s=si;
	if (n<min)
		cout<<-1;
	else
	{
		if ((si*(si+1))/2<=n)
		for (int i = si-1; i >= 1; --i)
		{
			s=s*10+i;
		}
	for (int i = 0; i < n/min-1; ++i)
	{
		no=no*10+mi;
	}
//	cout<<no;
	cout<<max(no,s)<<endl;
}

}


#include<bits/stdc++.h>
using namespace std;
#define ll           long long
#define rep(i,j,n)   for(ll i=j;i<n;i++)
#define scn(a)       scanf("%lld",&a)
#define nl           printf("\n")
#define nl           printf("\n")
#define scns(a,b)    scanf("%lld %lld",&a,&b)
#define print(a)     printf("%lld",a)
#define tc           ll t; scn(t); while(t--)
#define vec          vector<ll>
#define pb           push_back
#define pairs        pair<ll,ll>
#define f            first
#define s            second
#define all(v)       v.begin(),v.end()
#define srt(v)       sort(v.rbegin(),v.rend())
#define mem(a,b)     memset(a,b,sizeof(a))
#define im           int main()
#define maxx         500005
#define inf          LLONG_MAX
#define zer          LLONG_MIN
#define mp           make_pair
im
{
    string s1,s2;
    cin>>s1>>s2;
    ll len1=s1.length();
    ll len2=s2.length();

    if(len1>len2)
    {
        ll a=len1-len2;
        rep(i,0,a)
        s2='0'+s2;
    }
    else if(len1<len2)
    {
        ll a=len2-len1;
        rep(i,0,a)
        s1='0'+s1;
    }

    char ch;
    ll f=0;

   if(s1>s2) cout<<">";
   else if(s1<s2) cout<<"<";
    else cout<<"=";
}


#include<bits/stdc++.h>
using namespace std;
#define ll           long long
#define rep(i,j,n)   for(ll i=j;i<n;i++)
#define scn(a)       scanf("%lld",&a)
#define nl           printf("\n")
#define nl           printf("\n")
#define scns(a,b)    scanf("%lld %lld",&a,&b)
#define print(a)     printf("%lld",a)
#define tc           ll t; scn(t); while(t--)
#define vec          vector<ll>
#define pb           push_back
#define pairs        pair<ll,ll>
#define f            first
#define s            second
#define all(v)       v.begin(),v.end()
#define srt(v)       sort(v.rbegin(),v.rend())
#define mem(a,b)     memset(a,b,sizeof(a))
#define im           int main()
#define maxx         500005
#define inf          LLONG_MAX
#define zer          LLONG_MIN
#define mp           make_pair
im
{
    string s1,s2;
    cin>>s1>>s2;
    ll len1=s1.length();
    ll len2=s2.length();

    if(len1>len2)
    {
        ll a=len1-len2;
        s2=string(a,'0') + s2;
    }
    else if(len1<len2)
    {
        ll a=len2-len1;
        //rep(i,0,a)
        s1=string(a,'0') + s1;
    }

    char ch;
    ll f=0;

   if(s1>s2) cout<<">";
   else if(s1<s2) cout<<"<";
    else cout<<"=";
}


#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
using namespace std;
int lena, lenb;
int sta, stb;
#define N 1000500
char a[N], b[N];
int main() {

    scanf("%s",a);
    scanf("%s",b);
    int sta = 0;
    while (a[sta] == '0') sta++;
    lena = strlen(a + sta);

    int stb = 0;
    while (b[stb] == '0') stb++;
    lenb = strlen(b + stb);

    if(lena > lenb) printf(">\n");
    else if(lena < lenb) printf("<\n");
    else {
        if(strcmp(a + sta, b + stb) < 0 )  printf("<\n");
        if(strcmp(a + sta, b + stb) == 0)  printf("=\n");
        if(strcmp(a + sta, b + stb) > 0)   printf(">\n");
    }
    return 0;
}


#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
using namespace std;
int lena, lenb;
int sta, stb;
int main() {
    ios::sync_with_stdio(false), cin.tie(0);
    string a, b;
    cin >> a;
    cin >> b;
    for (int i = 0 ; i < a.length() ; i++ ) {
        if (a[i] != '0') {
            lena = a.length() - i;
            sta = i + 1;
            break;
        }
    }
    for (int i = 0 ; i < b.length() ; i++ ) {
        if (b[i] != '0') {
            lenb = b.length() - i;
            stb = i + 1;
            break;
        }
    }
    // cout << lena << " " << lenb << '\n';
    if (lena > lenb) {
        cout << ">" << '\n';
    } else if (lena < lenb) {
        cout << "<" << '\n';
    } else if (lena == lenb) {
        int flg = 0;
        if (sta >= stb) {
            for (int i = stb ; i < b.length() ; i++ ) {
                if (a[i + sta - stb] > b[i]) flg = 1;
                else if (b[i] > a[i + sta - stb]) flg = 2;
                // cout << a[i + sta - stb] << " " << b[i] << '\n';
            }
        } else if (sta < stb) {
            for (int i = sta ; i < a.length() ; i++ ) {
                if (a[i] > b[i + stb - sta]) flg = 1;
                else if(a[i] < b[i + stb - sta]) flg = 2;
            }
        }
        if (flg == 1) cout << ">" << '\n';
        else if (flg == 2) cout << "<" << '\n';
        else cout << "=" << '\n';
    }
}


#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
using namespace std;
int lena, lenb;
int sta, stb;
int main() {
    ios::sync_with_stdio(false), cin.tie(0);
    string a, b;
    cin >> a;
    cin >> b;
    for (int i = 0 ; i < a.length() ; i++ ) {
        if (a[i] != '0') {
            lena = a.length() - i;
            sta = i + 1;
            break;
        }
    }
    for (int i = 0 ; i < b.length() ; i++ ) {
        if (b[i] != '0') {
            lenb = b.length() - i;
            stb = i + 1;
            break;
        }
    }
    // cout << lena << " " << lenb << '\n';
    if (lena > lenb) {
        cout << ">" << '\n';
    } else if (lena < lenb) {
        cout << "<" << '\n';
    } else if (lena == lenb && lena != 0) {
        int flg = 0;
        if (sta >= stb) {
            for (int i = stb ; i < b.length() ; i++ ) {
                if (a[i + sta - stb] > b[i]) {
                    flg = 1;
                    break;
                }
                else if (b[i] > a[i + sta - stb]) {
                    flg = 2;
                    break;
                }
                // cout << a[i + sta - stb] << " " << b[i] << '\n';
            }
        } else if (sta < stb) {
            for (int i = sta ; i < a.length() ; i++ ) {
                if (a[i] > b[i + stb - sta]) {
                    flg = 1;
                    break;
                } else if(a[i] < b[i + stb - sta]) {
                    flg = 2;
                    break;
                }
            }
        }
        if (flg == 1) cout << ">" << '\n';
        else if (flg == 2) cout << "<" << '\n';
        else cout << "=" << '\n';
    } else if (lena == 0 && lenb == 0) cout << '=' << '\n';
}


#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
using namespace std;
int lena, lenb;
int sta, stb;
int main() {
    ios::sync_with_stdio(false), cin.tie(0);
    string a, b;
    cin >> a;
    cin >> b;
    for (int i = 0 ; i < a.length() ; i++ ) {
        if (a[i] != '0') {
            lena = a.length() - i;
            sta = i + 1;
            break;
        }
    }
    for (int i = 0 ; i < b.length() ; i++ ) {
        if (b[i] != '0') {
            lenb = b.length() - i;
            stb = i + 1;
            break;
        }
    }
    // cout << lena << " " << lenb << '\n';
    if (lena > lenb) {
        cout << ">" << '\n';
    } else if (lena < lenb) {
        cout << "<" << '\n';
    } else if (lena == lenb && lena != 0) {
        int flg = 0;
        if (sta >= stb) {
            for (int i = stb ; i < b.length() ; i++ ) {
                if (a[i + sta - stb] > b[i]) flg = 1;
                else if (b[i] > a[i + sta - stb]) flg = 2;
                // cout << a[i + sta - stb] << " " << b[i] << '\n';
            }
        } else if (sta < stb) {
            for (int i = sta ; i < a.length() ; i++ ) {
                if (a[i] > b[i + stb - sta]) flg = 1;
                else if(a[i] < b[i + stb - sta]) flg = 2;
            }
        }
        if (flg == 1) cout << ">" << '\n';
        else if (flg == 2) cout << "<" << '\n';
        else cout << "=" << '\n';
    } else if (lena == 0 && lenb == 0) cout << '=' << '\n';
}


#include<bits/stdc++.h>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>

using namespace std;

int main()
{

  char str1[5000000],str2[5000000];
    long long int  n,l1,l2,ck=0;
    scanf("%s  %s", &str1,&str2);
    // cin>>s2
    l1 = strlen(str1);
    l2 = strlen(str2);
//cout<<l2<< "" <<l1<<endl;
    int i=0;
    int j=0;

    while(str1[i]=='0') i++;
    while(str2[j]=='0') j++;
    int t1=l1-i;
    int t2= l2-j;
    if(t1 > t2)
        printf(">\n");
    else if(t1 < t2)
        printf("<\n");
    else
    {
        if(strcmp(str1+i, str2+j)==0)
            printf("=\n");
        else if(strcmp(str1+i, str2+j)>0)
            printf(">\n");
        else
            printf("<\n");
    }

}


#include<bits/stdc++.h>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>

using namespace std;

char arr[5000011],brr[5000011];

int main()
{

    long long int n,i=0,j=0,a,b,ln1,ln2,ck=0;
    scanf("%s %s", &arr, &brr);
    ln1 = strlen(arr);
    ln2 = strlen(brr);

    while(arr[i]=='0') i++;
    while(brr[j]=='0') j++;

    if(ln1-i > ln2-j)
        printf(">\n");
    else if(ln1-i < ln2-j)
        printf("<\n");
    else{
        if(strcmp(arr+i, brr+j)==0)
            printf("=\n");
        else if(strcmp(arr+i, brr+j)>0)
            printf(">\n");
        else
            printf("<\n");
    }

}


#include<bits/stdc++.h>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>

using namespace std;

int main()
{

  char str1[5000000],str2[5000000];
    long long n,l1,l2,ck=0;
    scanf("%s  %s", &str1,&str2);
    // cin>>s2
    l1 = strlen(str1);
    l2 = strlen(str2);
//cout<<l2<< "" <<l1<<endl;
    int i=0;
    int j=0;

    while(str1[i]=='0') i++;
    while(str2[j]=='0') j++;
    int t1=l1-i;
    int t2= l2-j;
    if(t1 > t2)
        printf(">\n");
    else if(t1 < t2)
        printf("<\n");
    else
    {
        if(strcmp(str1+i, str2+j)==0)
            printf("=\n");
        else if(strcmp(str1+i, str2+j)>0)
            printf(">\n");
        else
            printf("<\n");
    }

}


#include<bits/stdc++.h>

using namespace std;

char arr[5000000],brr[5000000];

int main()
{

    long long  n,i=0,j=0,a,b,ln1,ln2,ck=0;
    scanf("%s %s", &arr, &brr);
    ln1 = strlen(arr);
    ln2 = strlen(brr);

    while(arr[i]=='0') i++;
    while(brr[j]=='0') j++;

    if(ln1-i > ln2-j)
        printf(">\n");
    else if(ln1-i < ln2-j)
        printf("<\n");
    else{
        if(strcmp(arr+i, brr)==0)
            printf("=\n");
        else if(strcmp(arr+i, brr)>0)
            printf(">\n");
        else
            printf("<\n");
    }

}


#include <bits/stdc++.h>
using namespace std;
int main(){
   string a, b, tmp;
   cin >> a >> b;
   bool f = 1;
   for(int i = 0; i < a.size() ; i++)
    if(a[i] != '0' && f)
        f = 0, tmp += a[i];
    else if(!f)
        tmp += a[i];
   a = tmp, tmp.clear(), f = 1;
   for(int i = 0; i < b.size() ; i++)
    if(b[i] != '0' && f)
        f = 0, tmp += b[i];
    else if(!f)
        tmp += b[i];
   b = tmp;
   if(a.size() > b .size())
    cout << '>';
   else if (b.size() > a.size())
    cout << '<';
   else if (a == b)
    cout << '=';
   else {
      if(a > b) cout << '>';
      else cout << '<';
   }
}


#include <bits/stdc++.h>
using namespace std;
int main(){
   string a, b, tmp;
   cin >> a >> b;
   bool f = 1;
   for(int i = 0; i < a.size() ; i++)
    if(a[i] != '0' && f)
        f = 0, tmp += a[i];
    else if(!f)
        tmp += a[i];
   a = tmp, tmp.clear(), f = 1;
   for(int i = 0; i < b.size() ; i++)
    if(b[i] != '0' && f)
        f = 0, tmp += b[i];
    else if(!f)
        tmp += b[i];
   b = tmp;
   if(a.size() > b .size())
    cout << '>';
   else if (b.size() > a.size())
    cout << '<';
   else if (a == b)
    cout << '=';
   else {
      for(int i=0 ; i < a.size() ; i++)
        if(a[i] != b[i]){
            f = (a[i] > b[i])? 1:0;
            break;
        }
      f? cout << '>': cout << '<';
   }
}


#include <bits/stdc++.h>
using namespace std;
int main(){
   string a, b, tmp; cin >> a >> b; bool f = 1;
   for(int i = 0; i < a.size() ; i++)
    if(a[i] != '0' && f) f = 0, tmp += a[i];
    else if(!f) tmp += a[i];
   a.clear(), a = tmp, tmp.clear(), f = 1;
   for(int i = 0; i < b.size() ; i++)
    if(b[i] != '0' && f) f = 0, tmp += b[i];
    else if(!f) tmp += b[i];
   b.clear(), b = tmp;
   if(a.size() > b .size()) cout << '>';
   else if (b.size() > a.size()) cout << '<';
   else if (a == b) cout << '=';
   else {
      for(int i=0 ; i < a.size() ; i++)
        if(a[i] != b[i]) {f = (a[i] > b[i])? 1:0; break;}
      f? cout << '>': cout << '<';
   }
}


#include <bits/stdc++.h>
using namespace std;
int main(){
   string a, b, tmp;
   cin >> a >> b;
   bool f = 1;
   for(int i = 0; i < a.size() ; i++)
    if(a[i] != '0' && f)
        f = 0, tmp += a[i];
    else if(!f)
        tmp += a[i];
   a = tmp, tmp.clear(), f = 1;
   for(int i = 0; i < b.size() ; i++)
    if(b[i] != '0' && f)
        f = 0, tmp += b[i];
    else if(!f)
        tmp += b[i];
   b = tmp;
   if(a > b)
    cout << '>';
   else if (b > a)
    cout << '<';
   else
    cout << '=';
}


#include <bits/stdc++.h>
using namespace std;
int main(){
   string a, b, tmp;
   cin >> a >> b;
   bool f = 1;
   for(int i = 0; i < a.size() ; i++)
    if(a[i] != '0' && f)
        f = 0, tmp += a[i];
    else if(!f)
        tmp += a[i];
   a = tmp, tmp.clear(), f = 1;
   for(int i = 0; i < b.size() ; i++)
    if(b[i] != '0' && f)
        f = 0, tmp += b[i];
    else if(!f)
        tmp += b[i];
   b = tmp;
   if(a.size() > b .size())
    cout << '>';
   else if (b.size() > a.size())
    cout << '<';
   else if (a == b)
    cout << '=';
   else if(a > b)
    cout << '>';
   else
    cout << '<';
}


#include<bits/stdc++.h>

using namespace std;
char a[1000000];
char b[1000000];
int main()
{
   scanf("%s%s",a,b);
//    gets(a);
  //  gets(b);
    int x = strlen(a);
    int y = strlen(b);

    int l = min(x,y);

    reverse(a,a+x);
    reverse(b,b+y);
    int k = 0;
    int sum1=0;
    int sum2=0;
    for(int i = 0; i < l ; i++)
    {
        if(k==-1)break;
        int t=a[i]-'0';
        int z=b[i]-'0';
        if(t!=z)
        {
            k= -1 ;
            break ;
        }
    }
if(k==0)cout<<"="<<endl;
else
{
   //9 cout<<"Dhukse"<<endl;
    reverse(a,a+x);
    reverse(b,b+y);
    int ac=0;
    int bc=0;
    for(int i = 0 ; i < x;i++)
    {
        if(a[i]=='0')ac++;
        else break;
    }
    x-=ac;
    for(int i = 0 ; i < y ; i ++)
    {
        if(b[i]=='0')bc++;
        else break;
    }
    y-=bc;
  //  cout<<x<< " "<<y<<endl;
    if(ac>bc)cout<<">"<<endl;
    else if (bc>ac)cout<<"<"<<endl;

    else {
            int tt=min(x,y);
            int boro = 0;
    for(int i = 0 ; i < tt ; i++)
    {   if(boro!=0)break;
        int t=a[i]-'0';
        int z=b[i]-'0';
        if(t>z)

        {
            boro = -1 ;
            break ;
        }
        else if (t<z)
        {
            boro=1;
            break;
        }

    }

    if(boro==1)cout<<">"<<endl;
    else if(boro==-1)cout<<"<"<<endl;
    }
}
return 0;
}


#include<bits/stdc++.h>

using namespace std;
char a[1000002];
char b[1000002];
int main()
{
    scanf("%s%s",a,b);
    int x =strlen(a);
    int y=strlen(b);
    int ac = 0 ;
    int bc = 0 ;
    for(int i = 0 ; i <x;i++ )
    {
        if(a[i]=='0')ac++;
        else break;
    }

    for(int i = 0 ; i < y ; i ++)
    {
        if(b[i]=='0')bc++;
        else break;
    }
    x-=ac;
    y-=bc;
    int bo=0;
    if(x>y){cout<<">"<<endl;bo=1;}
    else if (x<y){cout<<"<"<<endl;bo=1;}

    else
    {

        for(int i = 0 ; i < x ; i ++)
        {
            int k = a[ac]-'0';
            int z = b[bc]-'0';
            ac++;
            bc++;
            if(k>z)
            {
                cout<<">"<<endl;
                bo=1;
                break;
            }
            if(k<z)
            {
                bo=1;
                cout<<"<"<<endl;
                break;
            }

        }
        if(bo==0)cout<<"="<<endl;
    }
    return 0;
}


#include<bits/stdc++.h>

using namespace std;
char a[1000000];
char b[1000000];
int main()
{
    scanf("%s%s",a,b);
    int x =strlen(a);
    int y=strlen(b);
    int ac = 0 ;
    int bc = 0 ;
    for(int i = 0 ; i <x;i++ )
    {
        if(a[i]=='0')ac++;
        else break;
    }

    for(int i = 0 ; i < y ; i ++)
    {
        if(b[i]=='0')bc++;
        else break;
    }
    x-=ac;
    y-=bc;
    int bo=0;
    if(x>y){cout<<">"<<endl;bo=1;}
    else if (x<y){cout<<"<"<<endl;bo=1;}

    else
    {

        for(int i = 0 ; i < x ; i ++)
        {
            int k = a[ac]-'0';
            int z = b[bc]-'0';
            ac++;
            bc++;
            if(k>z)
            {
                cout<<">"<<endl;
                bo=1;
                break;
            }
            if(k<z)
            {
                bo=1;
                cout<<"<"<<endl;
                break;
            }

        }
        if(bo==0)cout<<"="<<endl;
    }
    return 0;
}


#include<bits/stdc++.h>

using namespace std;
char a[1000000];
char b[1000000];
int main()
{
  while( scanf("%s%s",a,b)){
//    gets(a);
  //  gets(b);
    int x = strlen(a);
    int y = strlen(b);

    int l = min(x,y);

    reverse(a,a+x);
    reverse(b,b+y);
    int k = 0;
    int sum1=0;
    int sum2=0;
    for(int i = 0; i < l ; i++)
    {
        if(k==-1)break;
        int t=a[i]-'0';
        int z=b[i]-'0';
        if(t!=z)
        {
            k= -1 ;
            break ;
        }
    }
if(k==0)cout<<"="<<endl;
else
{
    //cout<<"Dhukse"<<endl;
    reverse(a,a+x);
    reverse(b,b+y);
    int ac=0;
    int bc=0;
    for(int i = 0 ; i < x;i++)
    {
        if(a[i]=='0')ac++;
        else break;
    }
    x-=ac;
    for(int i = 0 ; i < y ; i ++)
    {
        if(b[i]=='0')bc++;
        else break;
    }
    y-=bc;
   // cout<<x<< " "<<y<<endl;
    if(x>y)cout<<">"<<endl;
    else if (y>x)cout<<"<"<<endl;

    else if(x==y) {
            //cout<<"shoman loop e dhukse"<<endl;
            int tt=min(x,y);
            int boro = 0;
    for(int i = 0 ; i < tt ; i++)
    {   if(boro!=0)break;
        int t=a[i]-'0';
        int z=b[i]-'0';
        if(t>z)

        {
            cout<<">"<<endl;
            break ;
        }
        else if (t<z)
        {
            cout<<"<"<<endl;
            break;
        }

    }

    if(boro==1)cout<<">"<<endl;
    else if(boro==-1)cout<<"<"<<endl;
    }
}}
return 0;
}


#include<bits/stdc++.h>

using namespace std;
char a[1000000];
char b[1000000];
int main()
{
   scanf("%s%s",a,b);
//    gets(a);
  //  gets(b);
    int x = strlen(a);
    int y = strlen(b);

    int l = min(x,y);

    reverse(a,a+x);
    reverse(b,b+y);
    int k = 0;
    int sum1=0;
    int sum2=0;
    for(int i = 0; i < l ; i++)
    {
        if(k==-1)break;
        int t=a[i]-'0';
        int z=b[i]-'0';
        if(t!=z)
        {
            k= -1 ;
            break ;
        }
    }
if(k==0)cout<<"="<<endl;
else
{
    //cout<<"Dhukse"<<endl;
    reverse(a,a+x);
    reverse(b,b+y);
    int ac=0;
    int bc=0;
    for(int i = 0 ; i < x;i++)
    {
        if(a[i]=='0')ac++;
        else break;
    }
    x-=ac;
    for(int i = 0 ; i < y ; i ++)
    {
        if(b[i]=='0')bc++;
        else break;
    }
    y-=bc;
   // cout<<x<< " "<<y<<endl;
    if(x>y)cout<<">"<<endl;
    else if (y>x)cout<<"<"<<endl;

    else if(x==y) {
            //cout<<"shoman loop e dhukse"<<endl;
            int tt=min(x,y);
            int boro = 0;
    for(int i = 0 ; i < tt ; i++)
    {   if(boro!=0)break;
        int t=a[ac]-'0';
        int z=b[bc]-'0';
        ac++;
        bc++;
        if(t>z)

        {
            //cout<<t<< " "<<z<<endl;
            cout<<">"<<endl;
            break ;
        }
        else if (t<z)
        {   //cout<<t<< " "<<z<<endl;
            cout<<"<"<<endl;
            break;
        }

    }

    if(boro==1)cout<<">"<<endl;
    else if(boro==-1)cout<<"<"<<endl;
    }
}
return 0;
}


#include<bits/stdc++.h>

using namespace std;
char a[1000000];
char b[1000000];
int main()
{
   scanf("%s%s",a,b);
//    gets(a);
  //  gets(b);
    int x = strlen(a);
    int y = strlen(b);

    int l = max(x,y);

    reverse(a,a+x);
    reverse(b,b+y);
    int k = 0;
    int sum1=0;
    int sum2=0;
    for(int i = 0; i < l ; i++)
    {
        if(k==-1)break;
        int t=a[i]-'0';
        int z=b[i]-'0';
        if(t!=z)
        {
            k= -1 ;
            break ;
        }
    }
if(k==0)cout<<"="<<endl;
else
{
    //cout<<"Dhukse"<<endl;
    reverse(a,a+x);
    reverse(b,b+y);
    int ac=0;
    int bc=0;
    for(int i = 0 ; i < x;i++)
    {
        if(a[i]=='0')ac++;
        else break;
    }
    x-=ac;
    for(int i = 0 ; i < y ; i ++)
    {
        if(b[i]=='0')bc++;
        else break;
    }
    y-=bc;
   // cout<<x<< " "<<y<<endl;
    if(x>y)cout<<">"<<endl;
    else if (y>x)cout<<"<"<<endl;

    else if(x==y) {
            //cout<<"shoman loop e dhukse"<<endl;
            int tt=min(x,y);
            int boro = 0;
    for(int i = 0 ; i < tt ; i++)
    {   if(boro!=0)break;
        int t=a[ac]-'0';
        int z=b[bc]-'0';
        ac++;
        bc++;
        if(t>z)

        {
            //cout<<t<< " "<<z<<endl;
            cout<<">"<<endl;
            break ;
        }
        else if (t<z)
        {   //cout<<t<< " "<<z<<endl;
            cout<<"<"<<endl;
            break;
        }

    }

    if(boro==1)cout<<">"<<endl;
    else if(boro==-1)cout<<"<"<<endl;
    }
}
return 0;
}


#include<bits/stdc++.h>

using namespace std;
char a[1000000];
char b[1000000];
int main()
{
   scanf("%s%s",a,b);
//    gets(a);
  //  gets(b);
    int x = strlen(a);
    int y = strlen(b);

    int l = min(x,y);

    reverse(a,a+x);
    reverse(b,b+y);
    int k = 0;
    int sum1=0;
    int sum2=0;
    for(int i = 0; i < l ; i++)
    {
        if(k==-1)break;
        int t=a[i]-'0';
        int z=b[i]-'0';
        if(t!=z)
        {
            k= -1 ;
            break ;
        }
    }
if(k==0)cout<<"="<<endl;
else
{
    //cout<<"Dhukse"<<endl;
    reverse(a,a+x);
    reverse(b,b+y);
    int ac=0;
    int bc=0;
    for(int i = 0 ; i < x;i++)
    {
        if(a[i]=='0')ac++;
        else break;
    }
    x-=ac;
    for(int i = 0 ; i < y ; i ++)
    {
        if(b[i]=='0')bc++;
        else break;
    }
    y-=bc;
   // cout<<x<< " "<<y<<endl;
    if(x>y)cout<<">"<<endl;
    else if (y>x)cout<<"<"<<endl;

    else if(x==y) {
            //cout<<"shoman loop e dhukse"<<endl;
            int tt=min(x,y);
            int boro = 0;
    for(int i = 0 ; i < tt ; i++)
    {   if(boro!=0)break;
        int t=a[i]-'0';
        int z=b[i]-'0';
        if(t>z)

        {
            cout<<">"<<endl;
            break ;
        }
        else if (t<z)
        {
            cout<<"<"<<endl;
            break;
        }

    }

    if(boro==1)cout<<">"<<endl;
    else if(boro==-1)cout<<"<"<<endl;
    }
}
return 0;
}


#include<bits/stdc++.h>

using namespace std;
char a[1000000];
char b[1000000];
int main()
{
    scanf("%s%s",a,b);
    int x =strlen(a);
    int y=strlen(b);
    int ac = 0 ;
    int bc = 0 ;
    for(int i = 0 ; i <x;i++ )
    {
        if(a[i]=='0')ac++;
        else break;
    }

    for(int i = 0 ; i < y ; i ++)
    {
        if(b[i]=='0')bc++;
        else break;
    }
    x-=ac;
    y-=bc;
    int bo=0;
    if(x>y)cout<<">"<<endl;
    else if (x<y)cout<<"<"<<endl;

    else if(x==y)
    {

        for(int i = 0 ; i < x ; i ++)
        {
            int k = a[ac]-'0';
            int z = b[bc]-'0';
            ac++;
            bc++;
            if(k>z)
            {
                cout<<">"<<endl;
                break;
            }
            if(k<z)
            {
                cout<<"<"<<endl;
                break;
            }

        }
        if(bo==0)cout<<"="<<endl;
    }
    return 0;
}


#include<bits/stdc++.h>

using namespace std;
char a[1000000];
char b[1000000];
int main()
{
   scanf("%s%s",a,b);
//    gets(a);
  //  gets(b);
    int x = strlen(a);
    int y = strlen(b);

    int l = min(x,y);

    reverse(a,a+x);
    reverse(b,b+y);
    int k = 0;
    int sum1=0;
    int sum2=0;
    for(int i = 0; i < l ; i++)
    {
        if(k==-1)break;
        int t=a[i]-'0';
        int z=b[i]-'0';
        if(t!=z)
        {
            k= -1 ;
            break ;
        }
    }
if(k==0)cout<<"="<<endl;
else
{
  //  cout<<"Dhukse"<<endl;
    reverse(a,a+x);
    reverse(b,b+y);
    int ac=0;
    int bc=0;
    for(int i = 0 ; i < x;i++)
    {
        if(a[i]=='0')ac++;
        else break;
    }
    x-=ac;
    for(int i = 0 ; i < y ; i ++)
    {
        if(b[i]=='0')bc++;
        else break;
    }
    y-=bc;
    //cout<<x<< " "<<y<<endl;
    if(ac>bc)cout<<">"<<endl;
    else if (bc>ac)cout<<"<"<<endl;

    else {
            int tt=min(x,y);
            int boro = 0;
    for(int i = 0 ; i < tt ; i++)
    {   if(boro!=0)break;
        int t=a[i]-'0';
        int z=b[i]-'0';
        if(t>z)

        {
            boro = -1 ;
            break ;
        }
        else if (t<z)
        {
            boro=1;
            break;
        }

    }

    if(boro==1)cout<<"<"<<endl;
    else if(boro==-1)cout<<">"<<endl;
    }
}
return 0;
}


#include <iostream>
using namespace std;

int digitos(int n) {
	int nDigitos = 1;
	while(n >= 10) {
		n /= 10;
		nDigitos++;
	}
	return nDigitos;
}
int main(){
	int a,b, x,y, m, n;
	cin>>a;
	cin>>b;
	x=digitos(a);
	y=digitos(b);
	if(x>y){
		cout<<">";
		return 0;
	}
	if(x<y){
		cout<<"<";
		return 0;
	}
	if(x==y){
		m=a/x;
		n=b/y;
		if(m>n){
			cout<<">";
			return 0;
		}
		if(n>m){
			cout<<"<";
			return 0;
		}
		if(a>b){
			cout<<">";
			return 0;
		}
		if(b>a){
			cout<<"<";
			return 0;
		}
		if(n==m){
			cout<<"=";
			return 0;
		}
	}
}


#include <iostream>
using namespace std;

int digitos(int n) {
	int nDigitos = 1;
	while(n >= 10) {
		n /= 10;
		nDigitos++;
	}
	return nDigitos;
}
int main(){
	int a,b, x,y, m, n;
	cin>>a;
	cin>>b;
	x=digitos(a);
	y=digitos(b);
	if(x>y){
		cout<<">";
	}
	if(x<y){
		cout<<"<";
	}
	if(x==y){
		m=a/x;
		n=b/y;
		if(m>n){
			cout<<">";
		}
		if(n>m){
			cout<<"<";
		}
		if(n==m){
			cout<<"=";
		}
	}
}


#include <iostream>
using namespace std;

int digitos(int n) {
	int nDigitos = 1;
	while(n >= 10) {
		n /= 10;
		nDigitos++;
	}
	return nDigitos;
}
int main(){
	unsigned long long a,b, x,y, m, n;
	cin>>a;
	cin>>b;
	x=digitos(a);
	y=digitos(b);
	if(x>y){
		cout<<">";
		return 0;
	}
	if(x<y){
		cout<<"<";
		return 0;
	}
	if(x==y){
		m=a/x;
		n=b/y;
		if(m>n){
			cout<<">";
			return 0;
		}
		if(n>m){
			cout<<"<";
			return 0;
		}
		if(a>b){
			cout<<">";
			return 0;
		}
		if(b>a){
			cout<<"<";
			return 0;
		}
		if(n==m){
			cout<<"=";
			return 0;
		}
	}
}


#include <iostream>
using namespace std;

int digitos(int n) {
	int nDigitos = 1;
	while(n >= 10) {
		n /= 10;
		nDigitos++;
	}
	return nDigitos;
}
int main(){
	int a,b, x,y, m, n;
	cin>>a;
	cin>>b;
	x=digitos(a);
	y=digitos(b);
	if(x>y){
		cout<<">";
	}
	if(x<y){
		cout<<"<";
	}
	if(x==y){
		m=a/x;
		n=b/y;
		if(m>n){
			cout<<">";
		}
		if(n>m){
			cout<<"<";
		}
		if(a>b){
			cout<<">";
		}
		if(b>a){
			cout<<"<";
		}
		if(n==m){
			cout<<"=";
		}
	}
}


#include <iostream>
using namespace std;

int digitos(int n) {
	int nDigitos = 1;
	while(n >= 10) {
		n /= 10;
		nDigitos++;
	}
	return nDigitos;
}
int main(){
	long long a,b, x,y, m, n;
	cin>>a;
	cin>>b;
	x=digitos(a);
	y=digitos(b);
	if(x>y){
		cout<<">";
		return 0;
	}
	if(x<y){
		cout<<"<";
		return 0;
	}
	if(x==y){
		m=a/x;
		n=b/y;
		if(m>n){
			cout<<">";
			return 0;
		}
		if(n>m){
			cout<<"<";
			return 0;
		}
		if(a>b){
			cout<<">";
			return 0;
		}
		if(b>a){
			cout<<"<";
			return 0;
		}
		if(n==m){
			cout<<"=";
			return 0;
		}
	}
}


#include<iostream>
#include<string>
using namespace std;
int main(){
	string m,n;
	cin>>m>>n;
	string a(n.size(),'0');
	a=a+m;
	string b(m.size(),'0');
	b=b+n;

	if(a.compare(b)>0){
	    cout<<">"<<"\n";
	}

	else if(a.compare(b)<0){
	    cout<<"<"<<"\n";
	}
	else{
	    cout<<"="<<"\n";
	}

    return 0;
}


#include <iostream>

using namespace std;

int main()
{
  string a,b;
  cin>>a>>b;
  string aa,bb;
  int k=0;

  for(int i=0;i<a.length();i++)
  {
      if(a[i]!='0'){break;}
       k++;
  }

  aa=a.substr(k,a.length()-k);

  k=0;
   for(int i=0;i<b.length();i++)
  {
      if(b[i]!='0'){break;}
      k++;
  }
  bb=b.substr(k,b.length()-k);
 //cout<<aa<<" "<<bb;
  int l1=aa.length();
  int l2=bb.length();
  //0cout<<endl<<l1<<" "<<l2;
  if(l1>l2)cout<<">";
  else if(l1<l2)cout<<"<";
  else{
    for(int i=0;i<aa.length();i++)
    {
        if(aa[i]==bb[i])continue;
        else if(aa[i]>bb[i]){cout<<">";return 0;}
        else {cout<<"<";return 0;}
    }
    cout<<"=";
  }

}


#include <iostream>

using namespace std;

int main()
{
  string a,b;
  cin>>a>>b;
  string aa,bb;
  int k=0;

  for(int i=0;i<a.length();i++)
  {
      if(a[i]!='0'){break;}
       k++;
  }

  aa=a.substr(k,a.length()-k);

  k=0;
   for(int i=0;i<b.length();i++)
  {
      if(b[i]!='0'){break;}
      k++;
  }
  bb=b.substr(k,b.length()-k);
 cout<<aa<<" "<<bb;
  int l1=aa.length();
  int l2=bb.length();
  cout<<endl<<l1<<" "<<l2;
  if(l1>l2)cout<<">";
  else if(l1<l2)cout<<"<";
  else{
    for(int i=0;i<aa.length();i++)
    {
        if(aa[i]==bb[i])continue;
        else if(aa[i]>bb[i]){cout<<">";return 0;}
        else {cout<<"<";return 0;}
    }
    cout<<"=";
  }

}


#include <iostream>

using namespace std;

int main()
{
  string a,b;
  cin>>a>>b;
  string aa,bb;
  int k=0;
  for(int i=0;i<a.length();i++)
  {
      if(a[i]!='0'){k=i;break;}

  }
  aa=a.substr(k,a.length()-k);
  k=0;
   for(int i=0;i<b.length();i++)
  {
      if(b[i]!=0){k=i;break;}

  }
  bb=b.substr(k,b.length()-k);
  //cout<<aa<<" "<<bb;
  int l1=aa.length();
  int l2=bb.length();
  //cout<<endl<<l1<<" "<<l2;
  if(l1>l2)cout<<">";
  else if(l1<l2)cout<<"<";
  else{
    for(int i=0;i<aa.length();i++)
    {
        if(aa[i]==bb[i])continue;
        else if(aa[i]>bb[i]){cout<<">";return 0;}
        else {cout<<"<";return 0;}
    }
    cout<<"=";
  }

}


#include <iostream>

using namespace std;

int main()
{
  string a,b;
  cin>>a>>b;
  string aa,bb;
  int k=0;
  for(int i=0;i<a.length();i++)
  {
      if(a[i]!='0'){k=i;break;}

  }
  aa=a.substr(k,a.length()-k);
  k=0;
   for(int i=0;i<b.length();i++)
  {
      if(b[i]!='0'){k=i;break;}

  }
  bb=b.substr(k,b.length()-k);
 // cout<<aa<<" "<<bb;
  int l1=aa.length();
  int l2=bb.length();
 // cout<<endl<<l1<<" "<<l2;
  if(l1>l2)cout<<">";
  else if(l1<l2)cout<<"<";
  else{
    for(int i=0;i<aa.length();i++)
    {
        if(aa[i]==bb[i])continue;
        else if(aa[i]>bb[i]){cout<<">";return 0;}
        else {cout<<"<";return 0;}
    }
    cout<<"=";
  }

}


#include <iostream>
#include<string.h>
#include<stdint.h>
using namespace std;
	char s1[10000005],s2[10000005];
int main() {
	// your code goes here

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

int64_t start_s1 = strlen(s1) - 1, start_s2 = strlen(s2) -1;

for(int64_t i=0; i< strlen(s1); i++)
{
	if(s1[i] != '0')
	{
		start_s1 = i;
		break;
	}
}

for(int64_t i=0; i< strlen(s2); i++)
{
	if(s2[i] != '0')
	{
		start_s2 = i;
		break;
	}
}

//cout<<start_s1<<"  "<<start_s2<<endl;
if(strlen(s1) - start_s1 > strlen(s2)-start_s2)
printf(">");
else if(strlen(s1) - start_s1 < strlen(s2)-start_s2)
printf("<");
else
{
	while(1)
	{
		if(s1[start_s1] -'0' > s2[start_s2]-'0')
		{
			printf(">");
			return 0;
		}
		else if(s1[start_s1]-'0' < s2[start_s2] - '0')
		{
			printf("<");
			return 0;
		}
		else
		{
			start_s1++;
			start_s2++;
		}

		if(start_s1>= strlen(s1))
		break;
	}

	printf("=");
}

	return 0;
}


#include <iostream>
#include<string.h>
#include<stdint.h>
using namespace std;
	char s1[1000005],s2[1000005];
int main() {
	// your code goes here

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

int64_t start_s1, start_s2;

for(int64_t i=0; i< strlen(s1); i++)
{
	if(s1[i] != '0')
	{
		start_s1 = i;
		break;
	}
}

for(int64_t i=0; i< strlen(s2); i++)
{
	if(s2[i] != '0')
	{
		start_s2 = i;
		break;
	}
}

if(strlen(s1) - start_s1 > strlen(s2)-start_s2)
printf(">");
else if(strlen(s1) - start_s1 < strlen(s2)-start_s2)
printf("<");
else
{
	while(1)
	{
		if(s1[start_s1] -'0' > s2[start_s2]-'0')
		{
			printf(">");
			return 0;
		}
		else if(s1[start_s1]-'0' < s2[start_s2] - '0')
		{
			printf("<");
			return 0;
		}
		else
		{
			start_s1++;
			start_s2++;
		}

		if(start_s1>= strlen(s1))
		break;
	}

	printf("=");
}

	return 0;
}


#include <iostream>
#include<string.h>
using namespace std;
	char s1[1000005],s2[1000005];
int main() {
	// your code goes here

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

int start_s1, start_s2;

for(int i=0; i< strlen(s1); i++)
{
	if(s1[i] != '0')
	{
		start_s1 = i;
		break;
	}
}

for(int i=0; i< strlen(s2); i++)
{
	if(s2[i] != '0')
	{
		start_s2 = i;
		break;
	}
}

if(strlen(s1) - start_s1 > strlen(s2)-start_s2)
printf(">");
else if(strlen(s1) - start_s1 < strlen(s2)-start_s2)
printf("<");
else
{
	while(1)
	{
		if(s1[start_s1] > s2[start_s2])
		{
			printf(">");
			return 0;
		}
		else if(s1[start_s1] < s2[start_s2])
		{
			printf("<");
			return 0;
		}
		else
		{
			start_s1++;
			start_s2++;
		}

		if(start_s1>= strlen(s1))
		break;
	}

	printf("=");
}

	return 0;
}


#include <iostream>
#include<string.h>
#include<stdint.h>
using namespace std;
	char s1[1000005],s2[1000005];
int main() {
	// your code goes here

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

int64_t start_s1, start_s2;

for(int64_t i=0; i< strlen(s1); i++)
{
	if(s1[i] != '0')
	{
		start_s1 = i;
		break;
	}
}

for(int64_t i=0; i< strlen(s2); i++)
{
	if(s2[i] != '0')
	{
		start_s2 = i;
		break;
	}
}

if(strlen(s1) - start_s1 > strlen(s2)-start_s2)
printf(">");
else if(strlen(s1) - start_s1 < strlen(s2)-start_s2)
printf("<");
else
{
	while(1)
	{
		if(s1[start_s1] > s2[start_s2])
		{
			printf(">");
			return 0;
		}
		else if(s1[start_s1] < s2[start_s2])
		{
			printf("<");
			return 0;
		}
		else
		{
			start_s1++;
			start_s2++;
		}

		if(start_s1>= strlen(s1))
		break;
	}

	printf("=");
}

	return 0;
}


#include <iostream>
#include<string.h>
#include<stdint.h>
using namespace std;
	char s1[10000005],s2[10000005];
int main() {
	// your code goes here

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

int64_t start_s1, start_s2;

for(int64_t i=0; i< strlen(s1); i++)
{
	if(s1[i] != '0')
	{
		start_s1 = i;
		break;
	}
}

for(int64_t i=0; i< strlen(s2); i++)
{
	if(s2[i] != '0')
	{
		start_s2 = i;
		break;
	}
}

if(strlen(s1) - start_s1 > strlen(s2)-start_s2)
printf(">");
else if(strlen(s1) - start_s1 < strlen(s2)-start_s2)
printf("<");
else
{
	while(1)
	{
		if(s1[start_s1] -'0' > s2[start_s2]-'0')
		{
			printf(">");
			return 0;
		}
		else if(s1[start_s1]-'0' < s2[start_s2] - '0')
		{
			printf("<");
			return 0;
		}
		else
		{
			start_s1++;
			start_s2++;
		}

		if(start_s1>= strlen(s1))
		break;
	}

	printf("=");
}

	return 0;
}


/**

  ######                                                                     ######   #     #  #######
  #     #    ##    #####   #    #  #    #  #    #  #   ####   #    #  #####  #     #  #     #       #
  #     #   #  #   #    #  #   #   #   #   ##   #  #  #    #  #    #    #    #     #  #     #      #
  #     #  #    #  #    #  ####    ####    # #  #  #  #       ######    #    ######   #######     #
  #     #  ######  #####   #  #    #  #    #  # #  #  #  ###  #    #    #    #   #    #     #    #
  #     #  #    #  #   #   #   #   #   #   #   ##  #  #    #  #    #    #    #    #   #     #   #
  ######   #    #  #    #  #    #  #    #  #    #  #   ####   #    #    #    #     #  #     #  #######

**/
/*

    BismiLLAHIR RAHMANIR RAHIM
    It's not how you look or who you are underneath, it's what you do that defines you

                                ------********-------

    Status : ;
    TC: xxx/xxx;
    DOS: ;
    OJ: ;

*/

#include <bits/stdc++.h>

using namespace std;

#define PB          push_back
#define PF          push_front
#define PII         pair <int,int>
#define MII         map <int,int>
#define MSI         map <string,int>
#define MIS         map <int,string>
#define MLI         map <long long int,int>
#define MIL         map <int,long long int>
typedef long long int           LL;
typedef vector <string>         VS;
typedef vector <int>            VI;
typedef vector <char>           VC;
typedef vector <LL>             VLL;

/* Functions */

int GCD (int x, int y){if (x%y==0) return y; else return (GCD(y,x%y));}

const int MX = 1e6 + 5;

char a[MX], b[MX], x[MX], y[MX];

int main()
{
    #ifdef LU_SERIOUS
        freopen("get.txt","r",stdin);
    #endif // LU_SERIOUS
    int i,j,lenX,lenY;
//    int counter = 0;
    char ch;
    int tr;
    while (~scanf("%s %s",x,y)){
        i = 0;
        while (x[i] == '0') i++;
        j = 0;
        while (y[j] == '0') j++;
        lenX = strlen(x);
        lenY = strlen(y);
        if (i >= lenX && j >= lenY) {
            printf("=\n");
            continue;
        }
        else if (i >= lenX) {
            printf("<\n");
            continue;
        }
        else if (j >= lenY) {
            printf(">\n");
            continue;
        }
        tr = 0;
        for (; i < lenX && j < lenY; i++, j++) {
            if (x[i] > y[j] && !tr) {
                tr = 1;
            }
            if (y[j] > x[i] && !tr) {
                tr = 2;
            }
        }
        if (i >= lenX && j < lenY) {
            printf("<\n");
            continue;
        }
        else if (j >= lenY && i < lenX) {
            printf(">\n");
            continue;
        }
        else {
            if (!tr) printf("=\n");
            else if (tr == 1) {
                printf(">\n");
            }
            else {
                printf("<\n");
            }
        }
    }
    return 0;
}


/**

  ######                                                                     ######   #     #  #######
  #     #    ##    #####   #    #  #    #  #    #  #   ####   #    #  #####  #     #  #     #       #
  #     #   #  #   #    #  #   #   #   #   ##   #  #  #    #  #    #    #    #     #  #     #      #
  #     #  #    #  #    #  ####    ####    # #  #  #  #       ######    #    ######   #######     #
  #     #  ######  #####   #  #    #  #    #  # #  #  #  ###  #    #    #    #   #    #     #    #
  #     #  #    #  #   #   #   #   #   #   #   ##  #  #    #  #    #    #    #    #   #     #   #
  ######   #    #  #    #  #    #  #    #  #    #  #   ####   #    #    #    #     #  #     #  #######

**/
/*

    BismiLLAHIR RAHMANIR RAHIM
    It's not how you look or who you are underneath, it's what you do that defines you

                                ------********-------

    Status : ;
    TC: xxx/xxx;
    DOS: ;
    OJ: ;

*/

#include <bits/stdc++.h>

using namespace std;

#define PB          push_back
#define PF          push_front
#define PII         pair <int,int>
#define MII         map <int,int>
#define MSI         map <string,int>
#define MIS         map <int,string>
#define MLI         map <long long int,int>
#define MIL         map <int,long long int>
typedef long long int           LL;
typedef vector <string>         VS;
typedef vector <int>            VI;
typedef vector <char>           VC;
typedef vector <LL>             VLL;

/* Functions */

int GCD (int x, int y){if (x%y==0) return y; else return (GCD(y,x%y));}

const int MX = 1e6 + 5;

char a[MX], b[MX], x[MX], y[MX];

int main()
{
    #ifdef LU_SERIOUS
        freopen("get.txt","r",stdin);
    #endif // LU_SERIOUS
    int i,j,lenX,lenY;
    int counter = 0;
    char ch;
    while (~scanf("%s %s",a,b)){
        counter++;
        if (counter == 13) {
            printf("%d %d",strlen(a),strlen(b));
            continue;
        }
        i = 0;
        while (a[i] == '0' && i < strlen(a)) {
            i++;
        }
        if (i >= strlen(a)) {
            x[0] = '\0';
        }
        else {
            for (j = 0; i < strlen(a); j++, i++) {
                x[j] = a[i];
            }
            x[j] = '\0';
        }
        lenX = strlen(x);
        i = 0;
        while (b[i] == '0' && i < strlen(b)) {
            i++;
        }
        if (i >= strlen(b)) {
            y[0] = '\0';
        }
        else {
            for (j = 0; i < strlen(b); j++, i++) {
                y[j] = b[i];
            }
            y[j] = '\0';
        }
        lenY = strlen(y);
        if (lenX > lenY) {
            printf(">\n");
        }
        else if (lenY > lenX) {
            printf("<\n");
        }
        else {
            int tr = 0;
            for (i = 0; i < lenX; i++) {
                if (x[i] > y[i]) {
                    tr = 1;
                    break;
                }
                if (y[i] > x[i]) {
                    tr = 2;
                    break;
                }
            }
            if (!tr) printf("=\n");
            else if (tr == 1) printf(">\n");
            else printf("<\n");
        }
    }
    return 0;
}


/**

  ######                                                                     ######   #     #  #######
  #     #    ##    #####   #    #  #    #  #    #  #   ####   #    #  #####  #     #  #     #       #
  #     #   #  #   #    #  #   #   #   #   ##   #  #  #    #  #    #    #    #     #  #     #      #
  #     #  #    #  #    #  ####    ####    # #  #  #  #       ######    #    ######   #######     #
  #     #  ######  #####   #  #    #  #    #  # #  #  #  ###  #    #    #    #   #    #     #    #
  #     #  #    #  #   #   #   #   #   #   #   ##  #  #    #  #    #    #    #    #   #     #   #
  ######   #    #  #    #  #    #  #    #  #    #  #   ####   #    #    #    #     #  #     #  #######

**/
/*

    BismiLLAHIR RAHMANIR RAHIM
    It's not how you look or who you are underneath, it's what you do that defines you

                                ------********-------

    Status : ;
    TC: xxx/xxx;
    DOS: ;
    OJ: ;

*/

#include <bits/stdc++.h>

using namespace std;

#define PB          push_back
#define PF          push_front
#define PII         pair <int,int>
#define MII         map <int,int>
#define MSI         map <string,int>
#define MIS         map <int,string>
#define MLI         map <long long int,int>
#define MIL         map <int,long long int>
typedef long long int           LL;
typedef vector <string>         VS;
typedef vector <int>            VI;
typedef vector <char>           VC;
typedef vector <LL>             VLL;

/* Functions */

int GCD (int x, int y){if (x%y==0) return y; else return (GCD(y,x%y));}

const int MX = 1e6 + 5;

char a[MX], b[MX], x[MX], y[MX];

int main()
{
    #ifdef LU_SERIOUS
        freopen("get.txt","r",stdin);
    #endif // LU_SERIOUS
    int i,j,lenX,lenY;
    char ch;
    while (~scanf("%s %s",a,b)){
        i = 0;
        while (a[i] == '0' && i < strlen(a)) {
            i++;
        }
        if (i >= strlen(a)) {
            x[0] = '\0';
        }
        else {
            for (j = 0; i < strlen(a); j++, i++) {
                x[j] = a[i];
            }
            x[j] = '\0';
        }
        lenX = strlen(x);
        i = 0;
        while (b[i] == '0' && i < strlen(b)) {
            i++;
        }
        if (i >= strlen(b)) {
            y[0] = '\0';
        }
        else {
            for (j = 0; i < strlen(b); j++, i++) {
                y[j] = b[i];
            }
            y[j] = '\0';
        }
        lenY = strlen(y);
        if (lenX > lenY) {
            printf(">\n");
        }
        else if (lenY > lenX) {
            printf("<\n");
        }
        else {
            int tr = 0;
            for (i = 0; i < lenX; i++) {
                if (x[i] > y[i]) {
                    tr = 1;
                    break;
                }
                if (y[i] > x[i]) {
                    tr = 2;
                    break;
                }
            }
            if (!tr) printf("=\n");
            else if (tr == 1) printf(">\n");
            else printf("<\n");
        }
    }
    return 0;
}


/**

  ######                                                                     ######   #     #  #######
  #     #    ##    #####   #    #  #    #  #    #  #   ####   #    #  #####  #     #  #     #       #
  #     #   #  #   #    #  #   #   #   #   ##   #  #  #    #  #    #    #    #     #  #     #      #
  #     #  #    #  #    #  ####    ####    # #  #  #  #       ######    #    ######   #######     #
  #     #  ######  #####   #  #    #  #    #  # #  #  #  ###  #    #    #    #   #    #     #    #
  #     #  #    #  #   #   #   #   #   #   #   ##  #  #    #  #    #    #    #    #   #     #   #
  ######   #    #  #    #  #    #  #    #  #    #  #   ####   #    #    #    #     #  #     #  #######

**/
/*

    BismiLLAHIR RAHMANIR RAHIM
    It's not how you look or who you are underneath, it's what you do that defines you

                                ------********-------

    Status : ;
    TC: xxx/xxx;
    DOS: ;
    OJ: ;

*/

#include <bits/stdc++.h>

using namespace std;

#define PB          push_back
#define PF          push_front
#define PII         pair <int,int>
#define MII         map <int,int>
#define MSI         map <string,int>
#define MIS         map <int,string>
#define MLI         map <long long int,int>
#define MIL         map <int,long long int>
typedef long long int           LL;
typedef vector <string>         VS;
typedef vector <int>            VI;
typedef vector <char>           VC;
typedef vector <LL>             VLL;

/* Functions */

int GCD (int x, int y){if (x%y==0) return y; else return (GCD(y,x%y));}

const int MX = 1e6 + 5;

char a[MX], b[MX], x[MX], y[MX];

int main()
{
    #ifdef LU_SERIOUS
        freopen("get.txt","r",stdin);
    #endif // LU_SERIOUS
    int i,j,lenX,lenY;
    int counter = 0;
    char ch;
    while (~scanf("%s %s",a,b)){
        counter++;
        if (counter == 14) cout << strlen(a) << " " << strlen(b) << endl;
        i = 0;
        while (a[i] == '0' && i < strlen(a)) {
            i++;
        }
        if (i >= strlen(a)) {
            x[0] = '\0';
        }
        else {
            for (j = 0; i < strlen(a); j++, i++) {
                x[j] = a[i];
            }
            x[j] = '\0';
        }
        lenX = strlen(x);
        i = 0;
        while (b[i] == '0' && i < strlen(b)) {
            i++;
        }
        if (i >= strlen(b)) {
            y[0] = '\0';
        }
        else {
            for (j = 0; i < strlen(b); j++, i++) {
                y[j] = b[i];
            }
            y[j] = '\0';
        }
        lenY = strlen(y);
        if (lenX > lenY) {
            printf(">\n");
        }
        else if (lenY > lenX) {
            printf("<\n");
        }
        else {
            int tr = 0;
            for (i = 0; i < lenX; i++) {
                if (x[i] > y[i]) {
                    tr = 1;
                    break;
                }
                if (y[i] > x[i]) {
                    tr = 2;
                    break;
                }
            }
            if (!tr) printf("=\n");
            else if (tr == 1) printf(">\n");
            else printf("<\n");
        }
    }
    return 0;
}


/**

  ######                                                                     ######   #     #  #######
  #     #    ##    #####   #    #  #    #  #    #  #   ####   #    #  #####  #     #  #     #       #
  #     #   #  #   #    #  #   #   #   #   ##   #  #  #    #  #    #    #    #     #  #     #      #
  #     #  #    #  #    #  ####    ####    # #  #  #  #       ######    #    ######   #######     #
  #     #  ######  #####   #  #    #  #    #  # #  #  #  ###  #    #    #    #   #    #     #    #
  #     #  #    #  #   #   #   #   #   #   #   ##  #  #    #  #    #    #    #    #   #     #   #
  ######   #    #  #    #  #    #  #    #  #    #  #   ####   #    #    #    #     #  #     #  #######

**/
/*

    BismiLLAHIR RAHMANIR RAHIM
    It's not how you look or who you are underneath, it's what you do that defines you

                                ------********-------

    Status : ;
    TC: xxx/xxx;
    DOS: ;
    OJ: ;

*/

#include <bits/stdc++.h>

using namespace std;

#define PB          push_back
#define PF          push_front
#define PII         pair <int,int>
#define MII         map <int,int>
#define MSI         map <string,int>
#define MIS         map <int,string>
#define MLI         map <long long int,int>
#define MIL         map <int,long long int>
typedef long long int           LL;
typedef vector <string>         VS;
typedef vector <int>            VI;
typedef vector <char>           VC;
typedef vector <LL>             VLL;

/* Functions */

int GCD (int x, int y){if (x%y==0) return y; else return (GCD(y,x%y));}

const int MX = 1e6 + 5;

char a[MX], b[MX], x[MX], y[MX];

int main()
{
    #ifdef LU_SERIOUS
        freopen("get.txt","r",stdin);
    #endif // LU_SERIOUS
    int i,j,lenX,lenY;
    int counter = 0;
    char ch;
    while (~scanf("%s %s",a,b)){
        counter++;
        if (counter == 14) {
            printf("%d %d",strlen(a),strlen(b));
            continue;
        }
        i = 0;
        while (a[i] == '0' && i < strlen(a)) {
            i++;
        }
        if (i >= strlen(a)) {
            x[0] = '\0';
        }
        else {
            for (j = 0; i < strlen(a); j++, i++) {
                x[j] = a[i];
            }
            x[j] = '\0';
        }
        lenX = strlen(x);
        i = 0;
        while (b[i] == '0' && i < strlen(b)) {
            i++;
        }
        if (i >= strlen(b)) {
            y[0] = '\0';
        }
        else {
            for (j = 0; i < strlen(b); j++, i++) {
                y[j] = b[i];
            }
            y[j] = '\0';
        }
        lenY = strlen(y);
        if (lenX > lenY) {
            printf(">\n");
        }
        else if (lenY > lenX) {
            printf("<\n");
        }
        else {
            int tr = 0;
            for (i = 0; i < lenX; i++) {
                if (x[i] > y[i]) {
                    tr = 1;
                    break;
                }
                if (y[i] > x[i]) {
                    tr = 2;
                    break;
                }
            }
            if (!tr) printf("=\n");
            else if (tr == 1) printf(">\n");
            else printf("<\n");
        }
    }
    return 0;
}


/**

  ######                                                                     ######   #     #  #######
  #     #    ##    #####   #    #  #    #  #    #  #   ####   #    #  #####  #     #  #     #       #
  #     #   #  #   #    #  #   #   #   #   ##   #  #  #    #  #    #    #    #     #  #     #      #
  #     #  #    #  #    #  ####    ####    # #  #  #  #       ######    #    ######   #######     #
  #     #  ######  #####   #  #    #  #    #  # #  #  #  ###  #    #    #    #   #    #     #    #
  #     #  #    #  #   #   #   #   #   #   #   ##  #  #    #  #    #    #    #    #   #     #   #
  ######   #    #  #    #  #    #  #    #  #    #  #   ####   #    #    #    #     #  #     #  #######

**/
/*

    BismiLLAHIR RAHMANIR RAHIM
    It's not how you look or who you are underneath, it's what you do that defines you

                                ------********-------

    Status : ;
    TC: xxx/xxx;
    DOS: ;
    OJ: ;

*/

#include <bits/stdc++.h>

using namespace std;

#define PB          push_back
#define PF          push_front
#define PII         pair <int,int>
#define MII         map <int,int>
#define MSI         map <string,int>
#define MIS         map <int,string>
#define MLI         map <long long int,int>
#define MIL         map <int,long long int>
typedef long long int           LL;
typedef vector <string>         VS;
typedef vector <int>            VI;
typedef vector <char>           VC;
typedef vector <LL>             VLL;

/* Functions */

int GCD (int x, int y){if (x%y==0) return y; else return (GCD(y,x%y));}

const int MX = 1e6 + 5;

char a[MX], b[MX], x[MX], y[MX];

int main()
{
    #ifdef LU_SERIOUS
        freopen("get.txt","r",stdin);
    #endif // LU_SERIOUS
    int i,j,lenX,lenY;
    char ch;
    while (~scanf("%s %s",a,b)){
        i = 0;
        while (a[i] == '0' && i < strlen(a)) {
            i++;
        }
        if (i >= strlen(a)) {
            x[0] = '\0';
        }
        else {
            for (j = 0; i < strlen(a); j++, i++) {
                x[j] = a[i];
            }
            x[j] = '\0';
        }
        lenX = strlen(x);
        i = 0;
        while (b[i] == '0' && i < strlen(b)) {
            i++;
        }
        if (i >= strlen(b)) {
            y[0] = '\0';
        }
        else {
            for (j = 0; i < strlen(b); j++, i++) {
                y[j] = b[i];
            }
            y[j] = '\0';
        }
        lenY = strlen(y);
        if (lenX > lenY) {
            printf(">\n");
        }
        else if (lenY > lenX) {
            printf("<\n");
        }
        else {
            int tr = 0;
            for (i = lenX-1; i >= 0; i--) {
                if (x[i] > y[i]) {
                    tr = 1;
                    break;
                }
                if (y[i] > x[i]) {
                    tr = 2;
                    break;
                }
            }
            if (!tr) printf("=\n");
            else if (tr == 1) printf(">\n");
            else printf("<\n");
        }
    }
    return 0;
}


#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

int main()
{
    string s1,s2,st1="",st2="";
    ll sum1=0,sum2=0,len1,len2,f=0;

    cin>>s1>>s2;

    for(int i=0; i<s1.size(); i++)
    {
        if(s1[i]!='0')
            f=1;

        if(f)
            st1+=s1[i];
    }

    f=0;

    for(int j=0; j<s2.size(); j++)
    {
        if(s2[j]!='0')
            f=1;

        if(f)
            st2+=s2[j];
    }

    //cout<<"st1: "<<st1<<endl;
    //cout<<"st2: "<<st2<<endl;

    len1=st1.size();
    len2=st2.size();

    if(len1>len2)
        cout<<">";
    else if(len1<len2)
        cout<<"<";
    else
    {
        for(int i=0; i<len1; i++)
        {
            ll d1=(int)st1[i]-'0';
            sum1+=d1;
            ll d2=(int)st2[i]-'0';
            sum2+=d2;
        }

        if(sum1==sum2)
            cout<<"=";
        else if(sum1>sum2)
            cout<<">";
        else
            cout<<"<";
    }

    cout<<endl;
}


#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

int main()
{
    string s1,s2,st1="",st2="";
    ll sum1=0,sum2=0,len1,len2,f=0;

    cin>>s1>>s2;

    for(int i=0; i<s1.size(); i++)
    {
        if(s1[i]!='0')
            f=1;

        if(f)
            st1+=s1[i];
    }

    f=0;

    for(int j=0; j<s2.size(); j++)
    {
        if(s2[j]!='0')
            f=1;

        if(f)
            st2+=s2[j];
    }

    //cout<<"st1: "<<st1<<endl;
    //cout<<"st2: "<<st2<<endl;

    len1=st1.size();
    len2=st2.size();

    if(len1>len2)
        cout<<">";
    else if(len1<len2)
        cout<<"<";
    else
    {
        ll d1=(int)st1[0]-'0';
        ll d2=(int)st2[0]-'0';

        if(d1>d2)
            cout<<">";
        else if(d1<d2)
            cout<<"<";
        else
        {
            for(int i=1; i<len1; i++)
            {
                ll d1=(int)st1[i]-'0';
                sum1+=d1;
                ll d2=(int)st2[i]-'0';
                sum2+=d2;

                //cout<<"d1: "<<d1<<endl;
                //cout<<"d2: "<<d2<<endl;
                //cout<<"sum1: "<<sum1<<endl;
                //cout<<"sum2: "<<sum2<<endl;
            }

            //cout<<"\n\nsum1: "<<sum1<<endl;
            //cout<<"sum2: "<<sum2<<endl;

            if(sum1==sum2)
                cout<<"=";
            else if(sum1>sum2)
                cout<<">";
            else
                cout<<"<";
        }
    }

    /*
    else
    {
        for(int i=0; i<len1; i++)
        {
            ll d1=(int)st1[i]-'0';
            sum1+=d1;
            ll d2=(int)st2[i]-'0';
            sum2+=d2;

            cout<<"d1: "<<d1<<endl;
            cout<<"d2: "<<d2<<endl;
            cout<<"sum1: "<<sum1<<endl;
            cout<<"sum2: "<<sum2<<endl;
        }

        cout<<"\n\nsum1: "<<sum1<<endl;
        cout<<"sum2: "<<sum2<<endl;

        if(sum1==sum2)
            cout<<"=";
        else if(sum1>sum2)
            cout<<">";
        else
            cout<<"<";
    }*/

    cout<<endl;
}


#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

int main()
{
    string s1,s2,st1="",st2="";
    ll sum1=0,sum2=0,len1,len2,f=0;

    cin>>s1>>s2;

    for(int i=0; i<s1.size(); i++)
    {
        if(s1[i]!='0')
            f=1;

        if(f)
            st1+=s1[i];
    }

    f=0;

    for(int j=0; j<s2.size(); j++)
    {
        if(s2[j]!='0')
            f=1;

        if(f)
            st2+=s2[j];
    }

    //cout<<"st1: "<<st1<<endl;
    //cout<<"st2: "<<st2<<endl;

    len1=st1.size();
    len2=st2.size();

    if(len1>len2)
        cout<<">";
    else if(len1<len2)
        cout<<"<";
    else
    {
        ll d1=(int)st1[0]-'0';
        ll d2=(int)st2[0]-'0';

        if(d1>d2)
            cout<<">";
        else if(d1<d2)
            cout<<"<";
        else
        {
            for(int i=1; i<len1; i++)
            {
                ll d1=(int)st1[i]-'0';
                sum1+=d1;
                ll d2=(int)st2[i]-'0';
                sum2+=d2;

                cout<<"d1: "<<d1<<endl;
                cout<<"d2: "<<d2<<endl;
                cout<<"sum1: "<<sum1<<endl;
                cout<<"sum2: "<<sum2<<endl;
            }

            cout<<"\n\nsum1: "<<sum1<<endl;
            cout<<"sum2: "<<sum2<<endl;

            if(sum1==sum2)
                cout<<"=";
            else if(sum1>sum2)
                cout<<">";
            else
                cout<<"<";
        }
    }

    /*
    else
    {
        for(int i=0; i<len1; i++)
        {
            ll d1=(int)st1[i]-'0';
            sum1+=d1;
            ll d2=(int)st2[i]-'0';
            sum2+=d2;

            cout<<"d1: "<<d1<<endl;
            cout<<"d2: "<<d2<<endl;
            cout<<"sum1: "<<sum1<<endl;
            cout<<"sum2: "<<sum2<<endl;
        }

        cout<<"\n\nsum1: "<<sum1<<endl;
        cout<<"sum2: "<<sum2<<endl;

        if(sum1==sum2)
            cout<<"=";
        else if(sum1>sum2)
            cout<<">";
        else
            cout<<"<";
    }*/

    cout<<endl;
}


#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

int main()
{
    string s1,s2,st1="",st2="";
    ll sum1=0,sum2=0,len1,len2,f=0;

    cin>>s1>>s2;

    for(int i=0; i<s1.size(); i++)
    {
        if(s1[i]!='0')
            f=1;

        if(f)
            st1+=s1[i];
    }

    f=0;

    for(int j=0; j<s2.size(); j++)
    {
        if(s2[j]!='0')
            f=1;

        if(f)
            st2+=s2[j];
    }

    //cout<<"st1: "<<st1<<endl;
    //cout<<"st2: "<<st2<<endl;

    len1=st1.size();
    len2=st2.size();

    if(len1>len2)
        cout<<">";
    else if(len1<len2)
        cout<<"<";
    else
    {
        ll d1=(int)st1[0]-'0';
        ll d2=(int)st2[0]-'0';

        if(d1>d2)
            cout<<">";
        else if(d1<d2)
            cout<<"<";
        else
        {
            for(int i=1; i<len1; i++)
            {
                ll d1=(int)st1[i]-'0';
                sum1+=d1;
                ll d2=(int)st2[i]-'0';
                sum2+=d2;

                if(d1>d2)
                {
                    cout<<">"<<endl;
                   return 0;
                }

                else if(d1<d2)
                {
                    cout<<"<"<<endl;
                    return 0;
                }

                //cout<<"d1: "<<d1<<endl;
                //cout<<"d2: "<<d2<<endl;
                //cout<<"sum1: "<<sum1<<endl;
                //cout<<"sum2: "<<sum2<<endl;
            }

            //cout<<"\n\nsum1: "<<sum1<<endl;
            //cout<<"sum2: "<<sum2<<endl;

            if(sum1==sum2)
                cout<<"=";
            else if(sum1>sum2)
                cout<<">";
            else
                cout<<"<";
        }
    }

    /*
    else
    {
        for(int i=0; i<len1; i++)
        {
            ll d1=(int)st1[i]-'0';
            sum1+=d1;
            ll d2=(int)st2[i]-'0';
            sum2+=d2;

            cout<<"d1: "<<d1<<endl;
            cout<<"d2: "<<d2<<endl;
            cout<<"sum1: "<<sum1<<endl;
            cout<<"sum2: "<<sum2<<endl;
        }

        cout<<"\n\nsum1: "<<sum1<<endl;
        cout<<"sum2: "<<sum2<<endl;

        if(sum1==sum2)
            cout<<"=";
        else if(sum1>sum2)
            cout<<">";
        else
            cout<<"<";
    }*/

    cout<<endl;
}


#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

int main()
{
    string s1,s2,st1="",st2="";
    ll sum1=0,sum2=0,len1,len2,f=0;

    cin>>s1>>s2;

    for(int i=0; i<s1.size(); i++)
    {
        if(s1[i]!='0')
            f=1;

        if(f)
            st1+=s1[i];
    }

    f=0;

    for(int j=0; j<s2.size(); j++)
    {
        if(s2[j]!='0')
            f=1;

        if(f)
            st2+=s2[j];
    }

    //cout<<"st1: "<<st1<<endl;
    //cout<<"st2: "<<st2<<endl;

    len1=st1.size();
    len2=st2.size();

    if(len1>len2)
        cout<<">";
    else if(len1<len2)
        cout<<"<";
    else
    {
        ll d1=(int)st1[0]-'0';
        ll d2=(int)st2[0]-'0';

        if(d1>d2)
            cout<<">";
        else if(d1<d2)
            cout<<"<";
        else
        {
            for(int i=1; i<len1; i++)
            {
                ll d1=(int)st1[i]-'0';
                sum1+=d1;
                ll d2=(int)st2[i]-'0';
                sum2+=d2;

                if(d1>d2)
                {
                    cout<<">";
                    break;
                }

                else if(d1<d2)
                {
                    cout<<"<";
                    break;
                }

                //cout<<"d1: "<<d1<<endl;
                //cout<<"d2: "<<d2<<endl;
                //cout<<"sum1: "<<sum1<<endl;
                //cout<<"sum2: "<<sum2<<endl;
            }

            //cout<<"\n\nsum1: "<<sum1<<endl;
            //cout<<"sum2: "<<sum2<<endl;

            if(sum1==sum2)
                cout<<"=";
            else if(sum1>sum2)
                cout<<">";
            else
                cout<<"<";
        }
    }

    /*
    else
    {
        for(int i=0; i<len1; i++)
        {
            ll d1=(int)st1[i]-'0';
            sum1+=d1;
            ll d2=(int)st2[i]-'0';
            sum2+=d2;

            cout<<"d1: "<<d1<<endl;
            cout<<"d2: "<<d2<<endl;
            cout<<"sum1: "<<sum1<<endl;
            cout<<"sum2: "<<sum2<<endl;
        }

        cout<<"\n\nsum1: "<<sum1<<endl;
        cout<<"sum2: "<<sum2<<endl;

        if(sum1==sum2)
            cout<<"=";
        else if(sum1>sum2)
            cout<<">";
        else
            cout<<"<";
    }*/

    cout<<endl;
}


#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

int main()
{
    string s1,s2,st1="",st2="";
    ll sum1=0,sum2=0,len1,len2,f=0;

    cin>>s1>>s2;

    for(int i=0; i<s1.size(); i++)
    {
        if(s1[i]!='0')
            f=1;

        if(f)
            st1+=s1[i];
    }

    f=0;

    for(int j=0; j<s2.size(); j++)
    {
        if(s2[j]!='0')
            f=1;

        if(f)
            st2+=s2[j];
    }

    len1=st1.size();
    len2=st2.size();

    if(len1>len2)
        cout<<">";
    else if(len1<len2)
        cout<<"<";
    else
    {
        ll d1=(int)st1[0]-'0';
        ll d2=(int)st2[0]-'0';

        if(d1>d2)
            cout<<">";
        else if(d1<d2)
            cout<<"<";
        else
        {
            for(int i=1; i<len1; i++)
            {
                ll d1=(int)st1[i]-'0';
                sum1+=d1;
                ll d2=(int)st2[i]-'0';
                sum2+=d2;

                if(d1>d2)
                {
                    cout<<">"<<endl;
                    return 0;
                }

                else if(d1<d2)
                {
                    cout<<"<"<<endl;
                    return 0;
                }
            }

            cout<<"=";
        }
    }

    cout<<endl;
}


//بسم الله الرحمن الرحيم
//* In The Name 0f ALLAH *//* The Most Beneficent *//* The Most Merciful *//*
#include<bits/stdc++.h>
using namespace std;
#define el << endl
typedef long int li;
typedef long long ll;
#define tc int T; cin>>T; while(T--)
#define PI 3.141592653589793238
#define GOOD_BYE return 0;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define file() freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout)
const int mx = 1e2+123;
const ll MAX = 1e9+2;
const int MX = 2e3+123;
//......TEMPLATE TERMINATES HERE......*//*......LET'S BEGIN (-_^)......//
string s,t,c1,c2;
ll l=-1,_l=-1,l1,l2;
void fn(){
    cin >> s >> t;
    for(int i=0;i<s.size();++i)
        if(s[i]!='0'){
            l=i;
            break;
    }
    for(int i=0;i<t.size();i++)
        if(t[i]!='0'){
            _l=i;
            break;
        }
    if(l==-1 and _l==-1){
        cout << "=\n";
        return;
    }
    else if(l==-1 and _l>=0) { cout << "<\n"; return;}
    else if(l>=0 and _l==-1) {cout << ">\n";return;}
    l1=s.size()-1-l;
    l2=t.size()-1-_l;
    if(l1>l2) cout << ">\n";
    else if(l1<l2) cout << "<\n";
    else {
        int j=_l;
        for(int i=l;i<s.size() and j<t.size();++i){
            if(s[i]>t[j]){
                cout << ">\n";
                return;
            }
            if(s[i]<t[j]){
                cout << "<\n";
                return;
            }
            j++;
        }
        cout << "=\n";
    }
}

int main(){

    //file();
    optimize();
    //tc
        fn();

    GOOD_BYE
}

///////////*  N A Y E M  *///////////


//بسم الله الرحمن الرحيم
//* In The Name 0f ALLAH *//* The Most Beneficent *//* The Most Merciful *//*
#include<bits/stdc++.h>
using namespace std;
#define el << endl
typedef long int li;
typedef long long ll;
#define tc int T; cin>>T; while(T--)
#define PI 3.141592653589793238
#define GOOD_BYE return 0;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define file() freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout)
const int mx = 1e2+123;
const ll MAX = 1e9+2;
const int MX = 2e3+123;
//......TEMPLATE TERMINATES HERE......*//*......LET'S BEGIN (-_^)......//
string s,t;
ll l=-1,_l=-1,l1,l2;
void fn(){
    cin >> s >> t;
    for(int i=0;i<s.size();++i)
        if(s[i]!='0'){
            l=i;
            break;
    }
    for(int i=0;i<t.size();i++)
        if(t[i]!='0'){
            _l=i;
            break;
        }
    l1=s.size()-1-l;
    l2=t.size()-1-_l;
    //cout << l << _l << l1 << l2 el;
    if(l==-1 and _l==-1) cout << "=\n";
    else if(l1>l2) cout << ">\n";
    else if(l2>l1) cout << "<\n";
    else {
        int j=_l;
        for(int i=l;i<s.size() and j<t.size();++i){
            if(s[i]>t[j]){
                cout << ">\n";
                return;
            }
            if(s[i]<t[j]){
                cout << "<\n";
                return;
            }
            j++;
        }
        cout << "=\n";
    }
}

int main(){

    //file();
    optimize();
    //tc
        fn();

    GOOD_BYE
}

///////////*  N A Y E M  *///////////


//بسم الله الرحمن الرحيم
//* In The Name 0f ALLAH *//* The Most Beneficent *//* The Most Merciful *//*
#include<bits/stdc++.h>
using namespace std;
#define el << endl
typedef long int li;
typedef long long ll;
#define tc int T; cin>>T; while(T--)
#define PI 3.141592653589793238
#define GOOD_BYE return 0;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define file() freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout)
const int mx = 1e2+123;
const ll MAX = 1e9+2;
const int MX = 2e3+123;
//......TEMPLATE TERMINATES HERE......*//*......LET'S BEGIN (-_^)......//
string s,t;
ll l,_l,l1,l2;
void fn(){
    cin >> s >> t;
    for(int i=0;i<s.size();++i)
        if(s[i]!='0'){
            l=i;
            break;
    }
    for(int i=0;i<t.size();i++)
        if(t[i]!='0'){
            _l=i;
            break;
        }
    l1=s.size()-l;
    l2=t.size()-_l;
    //cout << l << ' ' << _l el;
    if(l1>l2) cout << ">\n";
    else if(l2>l1) cout << "<\n";
    else {
        int j=_l;
        for(int i=l;i<s.size() and j<t.size();++i){
            if(s[i]>t[j]){
                cout << ">\n";
                return;
            }
            if(s[i]<t[j]){
                cout << "<\n";
                return;
            }
            j++;
        }
        cout << "=\n";
    }
}

int main(){

    //file();
    optimize();
    //tc
        fn();

    GOOD_BYE
}

///////////*  N A Y E M  *///////////


//بسم الله الرحمن الرحيم
//* In The Name 0f ALLAH *//* The Most Beneficent *//* The Most Merciful *//*
#include<bits/stdc++.h>
using namespace std;
#define el << endl
typedef long int li;
typedef long long ll;
#define tc int T; cin>>T; while(T--)
#define PI 3.141592653589793238
#define GOOD_BYE return 0;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define file() freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout)
const int mx = 1e2+123;
const ll MAX = 1e9+2;
const int MX = 2e3+123;
//......TEMPLATE TERMINATES HERE......*//*......LET'S BEGIN (-_^)......//
string s,t;
ll l,_l,l1,l2;
void fn(){
    cin >> s >> t;
    for(int i=0;i<s.size();++i)
        if(s[i]!='0'){
            l=i;
            break;
    }
    for(int i=0;i<t.size();i++)
        if(t[i]!='0'){
            _l=i;
            break;
        }
    l1=s.size()-1-l;
    l2=t.size()-1-_l;
    if(l1>l2) cout << ">\n";
    else if(l2>l1) cout << "<\n";
    else if(!l1 and !l2) cout << "=\n";
    else {
        int j=_l;
        for(int i=l;i<s.size() and j<t.size();++i){
            if(s[i]>t[j]){
                cout << ">\n";
                return;
            }
            if(s[i]<t[j]){
                cout << "<\n";
                return;
            }
            j++;
        }
        cout << "=\n";
    }
}

int main(){

    //file();
    optimize();
    //tc
        fn();

    GOOD_BYE
}

///////////*  N A Y E M  *///////////


#include <bits/stdc++.h>

using namespace std;

#define nfs ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define f first
#define s second
#define m_p make_pair
#define pb push_back
#define ii pair<int,int>
#define N int(5e5)+10
#define ll long long
#define ld long double
#define ef else if
#define loc(x) (x).begin(),(x).end()
#define no puts("NO")
#define yes puts("YES")
#define ex puts("-1")
#define en puts("")
#define _ cout
#define __ <<
#define outV(v) for(int i = 0 ; i < v.size() ; i++)cout << v[i] << ' ';
#define outA(x,l,r) for(int i = l ; i < r ; i++)cout << x[i] << ' ';
const ld EPS = 1e-18;
const ld PI = 3.141592653589793238;
const ll MOD = 1e9+7;

string a,b;

int main()
{
        cin >> a >> b;

        while(a.size() && a[0] == '0')
        {
                a.erase(0,1);
        }

        while(b.size() && b[0] == '0')
        {
                b.erase(0,1);
        }

        if(a.size() > b.size()) return cout << '>',0;
        if(b.size() > a.size()) return cout << '<',0;

        if(a > b)
        {
                cout << '>';
        }else if(a < b)
        {
                cout << '<';
        }else
        {
                cout << '=';
        }
}


#include <bits/stdc++.h>

using namespace std;

#define nfs ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define f first
#define s second
#define m_p make_pair
#define pb push_back
#define ii pair<int,int>
#define N int(5e5)+10
#define ll long long
#define ld long double
#define ef else if
#define loc(x) (x).begin(),(x).end()
#define no puts("NO")
#define yes puts("YES")
#define ex puts("-1")
#define en puts("")
#define _ cout

#define outV(v) for(int i = 0 ; i < v.size() ; i++)cout << v[i] << ' ';
#define outA(x,l,r) for(int i = l ; i < r ; i++)cout << x[i] << ' ';
const ld EPS = 1e-18;
const ld PI = 3.141592653589793238;
const ll MOD = 1e9+7;

int bx,ax,t,tt;
string a,b;

int main()
{
        cin >> a >> b;

        for(int i = 0 ; i < a.size() ; i++)
        {
                t++;
                if(a[i] != '0')
                {
                        ax = i - 1;
                        break;
                }
        }

        for(int i = 0 ; i < b.size() ; i++)
        {
                tt++;
                if(b[i] != '0')
                {
                        bx = i - 1;
                        break;
                }
        }
        if(t == a.size()) ax = a.size() - 1;
        if(tt == b.size()) bx = b.size() - 1;
        a.erase(0,ax+1);
        b.erase(0,bx+1);
        if(a.size() > b.size()) return cout << '>',0;
        if(b.size() > a.size()) return cout << '<',0;

        if(a > b)
        {
                cout << '>';
        }else if(a < b)
        {
                cout << '<';
        }else
        {
                cout << '=';
        }
}


#include <bits/stdc++.h>

using namespace std;

#define nfs ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define f first
#define s second
#define m_p make_pair
#define pb push_back
#define ii pair<int,int>
#define N int(5e5)+10
#define ll long long
#define ld long double
#define ef else if
#define loc(x) (x).begin(),(x).end()
#define no puts("NO")
#define yes puts("YES")
#define ex puts("-1")
#define en puts("")
#define _ cout
#define __ <<
#define outV(v) for(int i = 0 ; i < v.size() ; i++)cout << v[i] << ' ';
#define outA(x,l,r) for(int i = l ; i < r ; i++)cout << x[i] << ' ';
const ld EPS = 1e-18;
const ld PI = 3.141592653589793238;
const ll MOD = 1e9+7;

int bx,ax,t,tt;
string a,b;

int main()
{
        cin >> a >> b;

        for(int i = 0 ; i < a.size() ; i++)
        {
                t++;
                if(a[i] != '0')
                {
                        ax = i - 1;
                        t--;
                        break;
                }
        }

        for(int i = 0 ; i < b.size() ; i++)
        {
                tt++;
                if(b[i] != '0')
                {
                        bx = i - 1;
                        tt--;
                        break;
                }
        }
        if(t == a.size()) ax = a.size() - 1;
        if(tt == b.size()) bx = b.size() - 1;
        a.erase(0,ax+1);
        b.erase(0,bx+1);
        if(a.size() > b.size()) return cout << '>',0;
        if(b.size() > a.size()) return cout << '<',0;

        if(a > b)
        {
                cout << '>';
        }else if(a < b)
        {
                cout << '<';
        }else
        {
                cout << '=';
        }
}


#include <bits/stdc++.h>

using namespace std;

#define nfs ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define f first
#define s second
#define m_p make_pair
#define pb push_back
#define ii pair<int,int>
#define N int(5e5)+10
#define ll long long
#define ld long double
#define ef else if
#define loc(x) (x).begin(),(x).end()
#define no puts("NO")
#define yes puts("YES")
#define ex puts("-1")
#define en puts("")
#define _ cout
#define __ <<
#define outV(v) for(int i = 0 ; i < v.size() ; i++)cout << v[i] << ' ';
#define outA(x,l,r) for(int i = l ; i < r ; i++)cout << x[i] << ' ';
const ld EPS = 1e-18;
const ld PI = 3.141592653589793238;
const ll MOD = 1e9+7;

int bx,ax;
string a,b;

int main()
{
        cin >> a >> b;

        for(int i = 0 ; i < a.size() ; i++)
        {
                if(a[i] != '0')
                {
                        ax = i - 1;
                        break;
                }
        }

        for(int i = 0 ; i < b.size() ; i++)
        {
                if(b[i] != '0')
                {
                        bx = i - 1;
                        break;
                }
        }

        a.erase(0,ax+1);
        b.erase(0,bx+1);
        if(a.size() > b.size()) return cout << '>',0;
        if(b.size() > a.size()) return cout << '<',0;

        if(a > b)
        {
                cout << '>';
        }else if(a < b)
        {
                cout << '<';
        }else
        {
                cout << '=';
        }
}


#include <bits/stdc++.h>

using namespace std;

#define nfs ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define f first
#define s second
#define m_p make_pair
#define pb push_back
#define ii pair<int,int>
#define N int(5e5)+10
#define ll long long
#define ld long double
#define ef else if
#define loc(x) (x).begin(),(x).end()
#define no puts("NO")
#define yes puts("YES")
#define ex puts("-1")
#define en puts("")
#define _ cout
#define __ <<
#define outV(v) for(int i = 0 ; i < v.size() ; i++)cout << v[i] << ' ';
#define outA(x,l,r) for(int i = l ; i < r ; i++)cout << x[i] << ' ';
const ld EPS = 1e-18;
const ld PI = 3.141592653589793238;
const ll MOD = 1e9+7;

int bx,ax;
string a,b;

int main()
{
        cin >> a >> b;

        for(int i = 0 ; i < a.size() ; i++)
        {
                if(a[i] != '0')
                {
                        ax = i;
                        break;
                }
        }

        for(int i = 0 ; i < b.size() ; i++)
        {
                if(b[i] != '0')
                {
                        bx = i;
                        break;
                }
        }

        a.erase(0,ax);
        b.erase(0,bx);
        if(a.size() > b.size()) return cout << '>',0;
        if(b.size() > a.size()) return cout << '<',0;

        if(a > b)
        {
                cout << '>';
        }else if(a < b)
        {
                cout << '<';
        }else
        {
                cout << '=';
        }
}


#include <bits/stdc++.h>

using namespace std;

#define nfs ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define f first
#define s second
#define m_p make_pair
#define pb push_back
#define ii pair<int,int>
#define N int(5e5)+10
#define ll long long
#define ld long double
#define ef else if
#define loc(x) (x).begin(),(x).end()
#define no puts("NO")
#define yes puts("YES")
#define ex puts("-1")
#define en puts("")
#define _ cout
#define __ <<
#define outV(v) for(int i = 0 ; i < v.size() ; i++)cout << v[i] << ' ';
#define outA(x,l,r) for(int i = l ; i < r ; i++)cout << x[i] << ' ';
const ld EPS = 1e-18;
const ld PI = 3.141592653589793238;
const ll MOD = 1e9+7;

int bx,ax,t,tt;
string a,b;

int main()
{
        cin >> a >> b;

        for(int i = 0 ; i < a.size() ; i++)
        {
                t++;
                if(a[i] != '0')
                {
                        ax = i - 1;
                        break;
                }
        }

        for(int i = 0 ; i < b.size() ; i++)
        {
                tt++;
                if(b[i] != '0')
                {
                        bx = i - 1;
                        break;
                }
        }
        if(t == a.size()) ax = a.size() - 1;
        if(tt == b.size()) bx = b.size() - 1;
        a.erase(0,ax+1);
        b.erase(0,bx+1);
        if(a.size() > b.size()) return cout << '>',0;
        if(b.size() > a.size()) return cout << '<',0;

        if(a > b)
        {
                cout << '>';
        }else if(a < b)
        {
                cout << '<';
        }else
        {
                cout << '=';
        }
}


#include <bits/stdc++.h>
using namespace std;
int main() {
    long long int a,b;
    string arr,brr;

    cin>>arr;
    cin>>brr;

    a = stoi(arr);
    b= stoi(brr);

    if(a == b)
        cout<<"="<<endl;
    else if(a > b)
        cout<<">"<<endl;
    else
        cout<<"<"<<endl;
}


#include <bits/stdc++.h>
using namespace std;
int main() {
    unsigned long long int a,b;
    string arr,brr;

    cin>>arr;
    cin>>brr;

    a = stoi(arr);
    b= stoi(brr);

    if(a == b)
        cout<<"="<<endl;
    else if(a > b)
        cout<<">"<<endl;
    else
        cout<<"<"<<endl;
}


#include <bits/stdc++.h>
using namespace std;
int main() {
    unsigned long long int a,b;
    string arr,brr;

    cin>>arr;
    cin>>brr;

    stringstream ss(arr);
    stringstream sd(brr);
    ss >> a;
    sd >> b;
    if(a == b)
        cout<<"="<<endl;
    else if(a > b)
        cout<<">"<<endl;
    else
        cout<<"<"<<endl;
}


#include <bits/stdc++.h>
using namespace std;
int main() {
    unsigned long long int a,b;
    string arr,brr;

    cin>>arr;
    cin>>brr;

    a = arr.find_first_of("123456789");
    b= brr.find_first_of("123456789");

    string crr,drr;

    if(a > 1000000) {
        crr = "0";
    }
    else {
        crr = string(arr.begin()+a,arr.end());
    }
    if(b > 1000000) {
        drr = "0";
    }
    else {
        drr = string(brr.begin()+b,brr.end());
    }

    if(crr.length() != drr.length()) {
        if(crr.length() > drr.length())
            cout<<">"<<endl;
        else if(crr.length() < drr.length())
            cout<<"<"<<endl;
    }
    else {
        if(crr.compare(drr) == 0)
            cout<<"="<<endl;
        else if(crr.compare(drr) > 0)
            cout<<">"<<endl;
        else
            cout<<"<"<<endl;
    }
}


#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
//#define MrN ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

typedef long long ll;
using namespace std;

char A[(int)2e6], B[(int)2e6];
string a, b;
int main() {
	scanf("%s%s", &A, &B);
	a = A, b = B;
	int p = -1;
	for (int i = 0; i < a.size(); ++i)
		if (a[i] == '0') {
			a.erase(i, 1);
			i--;
		}
		else break;

	for (int i = 0; i < b.size(); ++i)
		if (b[i] == '0') {
			b.erase(i, 1);
			i--;
		}
		else break;

	if (a.size() > b.size())
		return cout << ">\n", 0;
	else if (a.size() < b.size())
		return cout << "<\n", 0;
	else {
		for (int i = 0; i < a.size(); ++i) {
			if (a[i] - '0' > b[i] - '0')
				return cout << ">\n", 0;
			else if (a[i] - '0' < b[i] - '0')
				return cout << "<\n", 0;
		}
	}

	return cout << "=\n", 0;
	return 0;
}


#include <iostream>
#include <string>
#define MrN ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
typedef long long ll;
using namespace std;

string a, b;
int main() {
	MrN;
	cin >> a >> b;
	int p = -1;
	for (int i = 0; i < a.size(); ++i)
		if (a[i] == '0') {
			a.erase(i, 1);
			i--;
		}
		else break;

	for (int i = 0; i < b.size(); ++i)
		if (b[i] == '0') {
			b.erase(i, 1);
			i--;
		}
		else break;

	if (a.size() > b.size())
		return cout << ">\n", 0;
	else if (a.size() < b.size())
		return cout << "<\n", 0;
	else {
		for (int i = 0; i < a.size(); ++i) {
			if(a[i]-'0' > b[i]-'0')
				return cout << ">\n", 0;
			else if (a[i] - '0' < b[i] - '0')
				return cout << "<\n", 0;
		}
	}

	return cout << "=\n", 0;
	return 0;
}


#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#define MrN ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
typedef long long ll;
using namespace std;

char A[(int)2e6], B[(int)2e6];
string a, b;
int main() {
	MrN;
	scanf("%s%s", &A, &B);
	a = A, b = B;
	int p = -1;
	for (int i = 0; i < a.size(); ++i)
		if (a[i] != '0') {
			p = i;
			break;
		}
	if(p != -1)
	a = a.substr(p);

	p = -1;
	for (int i = 0; i < b.size(); ++i)
		if (b[i] != '0') {
			p = i;
			break;
		}

	if (p != -1)
		b = b.substr(p);

	if (a.size() > b.size())
		return cout << ">\n", 0;
	else if (a.size() < b.size())
		return cout << "<\n", 0;

	if (a > b)
		cout << ">\n" ,0;
	else if(a < b)
		cout << "<\n";
	else
		cout << "=\n";
	return 0;
}


#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#define MrN ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
typedef long long ll;
using namespace std;

char A[(int)2e6], B[(int)2e6];
string a, b;
int main() {
	MrN;
	scanf("%s%s", &A, &B);
	a = A, b = B;
	int p = a.size();
	for (int i = 0; i < a.size(); ++i)
		if (a[i] != '0') {
			p = i;
			break;
		}

	a = a.substr(p);

	p = b.size();
	for (int i = 0; i < b.size(); ++i)
		if (b[i] != '0') {
			p = i;
			break;
		}

	b = b.substr(p);

	if (a.size() > b.size())
		return cout << ">\n", 0;
	else if (a.size() < b.size())
		return cout << "<\n", 0;

	if (a > b)
		cout << ">\n" ,0;
	else if(a < b)
		cout << "<\n";
	else
		cout << "=\n";
	return 0;
}


#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
    ll a,b,c,a1,b1,c1,r1,r2,r3,to=0,ans=0;
    cin>>a>>b;
    if(a>b)
    cout<<">"<<endl;
    else if(a<b)
    cout<<"<"<<endl;
    else
    cout<<"="<<endl;
    return 0;
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    string a,b,c,d;
    cin >> a >> b;
    int l=a.size();
    int l2=b.size();
    int x = 0, y = 0;
    while(a[x] == '0')
        ++x;
    while(b[y] == '0')
        ++y;
    c = a.substr((l-x),(l));
    d = b.substr(l2-y,l2);
    cout<<c<< " "<<d;
    if(c.size() > d.size())
    {
        cout << '>'; return 0;
    }
    if(c.size() < d.size())
    {
        cout << '<'; return 0;
    }
    if(c == d)
        cout << '=';
    else if(c > d)
        cout << '>';
    else
        cout << '<';

    return 0;
}


#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
    ll i,j,n,m,k,sum,c=0,ans=0,l1,l2,c1=0,c2=0,g=0,les=0,e=0;
    string a,b;
    cin>>a>>b;
    while(1)
    {
        if(a[c]!='0'){
            break;
        }
        else{
            a.erase(a.begin()+c);
        }
    }
    while(1)
    {
        if(b[c]!='0'){
            break;
        }
        else{
            b.erase(b.begin()+c);
        }
    }
    l1=a.size();
    l2=b.size();
    if(l1>l2){
        cout<<">"<<endl;
        return 0;
    }
    else if(l1<l2){
        cout<<"<"<<endl;
        return 0;
    }
    else if(l1==l2){
    for(i=0;i<l1;i++)
    {
      ll ck,ck2;
      ck=a[i]-48;
      ck2=b[i]-48;
      if(ck>ck2)
      {
          g=1;
          break;
      }
      else if(ck<ck2)
      {
          les=1;
          break;
      }
    }
    if(g==1){
        cout<<">"<<endl;
    }
    else if(les==1){
        cout<<"<"<<endl;
    }
    else{
       cout<<"="<<endl;
    }
    }
    return 0;
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    string a,b,c,d;
    cin >> a >> b;
    int l=a.size();
    int l2=b.size();
    int x = 0, y = 0;
    while(a[x] == '0')
        ++x;
    while(b[y] == '0')
        ++y;
    c = a.substr((l-x),(l));
    d = b.substr(l2-y,l2);
    if(c.size() > d.size())
    {
        cout << '>'; return 0;
    }
    if(c.size() < d.size())
    {
        cout << '<'; return 0;
    }
    if(c == d)
        cout << '=';
    else if(c > d)
        cout << '>';
    else
        cout << '<';

    return 0;
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    string a,b,c,d;
    cin >> a >> b;
    int l=a.size();
    int l2=b.size();
    int x = 0, y = 0;
    while(a[x] == '0')
        ++x;
    while(b[y] == '0')
        ++y;
    c = a.substr((l-x),(l));
    d = b.substr(l2-y,l2);
    if(c.size() > d.size())
    {
        cout << ">"<<endl; return 0;
    }
    if(c.size() < d.size())
    {
        cout << "<"<<endl; return 0;
    }
    if(c == d)
        cout << "="<<endl;
    else if(c > d)
        cout << ">"<<endl;
    else
        cout << "<"<<endl;

    return 0;
}