import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class Longint {

	static PrintWriter pw;

	public static void main(String[] args)
	{
		MySimp sc=new MySimp();
		pw=new PrintWriter(new BufferedOutputStream(System.out));
		String a=sc.nextLine();
		String b=sc.nextLine();
		int i=0;
		while(a.charAt(i)=='0' && a.length()>=2){
			i++;
		a=a.substring(i);
		}
		i=0;
		while(b.charAt(i)=='0' && b.length()>=2){
			i++;
		b=b.substring(i);
		}

		if(a.length()>b.length())
			pw.println(">");
		else if(b.length()>a.length())
			pw.println("<");

		else{
			i=0;
			while(i<a.length() && (a.charAt(i)==b.charAt(i)))
				i++;

			if(i==a.length())
				pw.println("=");
			else if((int)a.charAt(i)>(int)b.charAt(i))
				pw.println(">");
			else
				pw.println("<");
		}

		pw.close();

	}

}
class MySimp
{
	BufferedReader br;
	StringTokenizer st;
	MySimp()
	{
		br=new BufferedReader(new InputStreamReader(System.in));
	}
	String next()
	{

		while(st==null || !st.hasMoreTokens())
		{
			try
			{
				st=new StringTokenizer(br.readLine());
			}
			catch(Exception e)
			{
				e.printStackTrace();
			}
		}
		return st.nextToken();

	}
	int nextInt()
	{
		return Integer.parseInt(next());
	}
	long nextLong()
	{
		return Long.parseLong(next());
	}
	double nextDouble()
	{
		return Double.parseDouble(next());
	}
	String nextLine()
	{
		String str="";
		try
		{
			str=br.readLine();
		}
		catch(Exception e)
		{
			e.printStackTrace();
		}
		return str;

	}
}


import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class Longint {

	static PrintWriter pw;

	public static void main(String[] args)
	{
		MySimp sc=new MySimp();
		pw=new PrintWriter(new BufferedOutputStream(System.out));
		String a=sc.nextLine();
		String b=sc.nextLine();
		int n1=a.length();
		int n2=b.length();

		if(n1>n2)
		{
			for(int i=0;i<n1-n2;i++)
			{
				b="0"+b;
			}
		}
		if(n2>n1)
		{
			for(int i=0;i<n2-n1;i++)
			{
				a="0"+a;
			}
		}
		int x=a.compareTo(b);
		if(x==0)
		{
			pw.println("=");
		}
		else if(x>0)
		{
			pw.println(">");
		}
		else
			pw.println("<");

		pw.close();

	}

}
class MySimp
{
	BufferedReader br;
	StringTokenizer st;
	MySimp()
	{
		br=new BufferedReader(new InputStreamReader(System.in));
	}
	String next()
	{

		while(st==null || !st.hasMoreTokens())
		{
			try
			{
				st=new StringTokenizer(br.readLine());
			}
			catch(Exception e)
			{
				e.printStackTrace();
			}
		}
		return st.nextToken();

	}
	int nextInt()
	{
		return Integer.parseInt(next());
	}
	long nextLong()
	{
		return Long.parseLong(next());
	}
	double nextDouble()
	{
		return Double.parseDouble(next());
	}
	String nextLine()
	{
		String str="";
		try
		{
			str=br.readLine();
		}
		catch(Exception e)
		{
			e.printStackTrace();
		}
		return str;

	}
}


import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class Longint {

	static PrintWriter pw;

	public static void main(String[] args)
	{
		MySimp sc=new MySimp();
		pw=new PrintWriter(new BufferedOutputStream(System.out));
		StringBuilder a=new StringBuilder(sc.nextLine());
		StringBuilder b=new StringBuilder(sc.nextLine());
		int n1=a.length();
		int n2=b.length();
		StringBuilder t=new StringBuilder();
		if(n1>n2)
		{
			for(int i=0;i<n1-n2;i++)
			{
				t=t.append("0");
			}
			b=t.append(b);
		}
		if(n2>n1)
		{
			for(int i=0;i<n2-n1;i++)
			{
				t=t.append("0");
			}
			a=t.append(a);
		}
		int x=a.toString().compareTo(b.toString());
		if(x==0)
		{
			pw.println("=");
		}
		else if(x>0)
		{
			pw.println(">");
		}
		else
			pw.println("<");

		pw.close();

	}

}
class MySimp
{
	BufferedReader br;
	StringTokenizer st;
	MySimp()
	{
		br=new BufferedReader(new InputStreamReader(System.in));
	}
	String next()
	{

		while(st==null || !st.hasMoreTokens())
		{
			try
			{
				st=new StringTokenizer(br.readLine());
			}
			catch(Exception e)
			{
				e.printStackTrace();
			}
		}
		return st.nextToken();

	}
	int nextInt()
	{
		return Integer.parseInt(next());
	}
	long nextLong()
	{
		return Long.parseLong(next());
	}
	double nextDouble()
	{
		return Double.parseDouble(next());
	}
	String nextLine()
	{
		String str="";
		try
		{
			str=br.readLine();
		}
		catch(Exception e)
		{
			e.printStackTrace();
		}
		return str;

	}
}


import java.beans.Visibility;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.Stack;
import java.util.StringTokenizer;

public class Main implements Runnable{

		 public static void main(String[] args) throws IOException {
			new Thread(null , new Main(),"Main", 1<<26).start();

		 }

		public void run(){
			try {
			PrintWriter out = new PrintWriter(System.out);
			MyScanner sc = new MyScanner();
			solve(out, sc);
			out.flush();
			out.close();
			}
			catch (Exception e) {
				e.printStackTrace();

			}
		}

		void solve(PrintWriter out, MyScanner sc) throws IOException{

			StringBuilder a = new StringBuilder(sc.nextLine());
			StringBuilder b = new StringBuilder(sc.nextLine());

			for(int i = 0 ; i < a.length() ; ++i) {
				if(a.charAt(i) != '0') break;
				else {a.deleteCharAt(i);--i;}
			}

			for(int i = 0; i < b.length(); ++i) {
				if(b.charAt(i) != '0') break;
				else { b.deleteCharAt(i);--i;}
			}

			if(a.length() > b.length()) out.print(">");
			else if(b.length() > a.length()) out.println("<");
			else {
				for(int i = 0; i < a.length() ; ++i) {
					if(a.charAt(i) > b.charAt(i)) { out.println(">"); return;}
					else if(b.charAt(i) > a.charAt(i)) { out.println("<"); return;}
				}
				out.println("=");
			}

		}

}

class MyScanner {
    BufferedReader br;
    StringTokenizer st;

    public MyScanner() {
       br = new BufferedReader(new InputStreamReader(System.in));
    }

    String next() {
        while (st == null || !st.hasMoreElements()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }

    int nextInt() { return Integer.parseInt(next());}

    long nextLong() {return Long.parseLong(next());}

    double nextDouble() {return Double.parseDouble(next());}

    String nextLine(){
        String str = "";
	  try {
	     str = br.readLine();
	  } catch (IOException e) {
	     e.printStackTrace();
	  }
	  return str;
    }

}


import java.beans.Visibility;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.Stack;
import java.util.StringTokenizer;

public class Main implements Runnable{

		 public static void main(String[] args) throws IOException {
			new Thread(null , new Main(),"Main", 1<<26).start();

		 }

		public void run(){
			try {
			PrintWriter out = new PrintWriter(System.out);
			MyScanner sc = new MyScanner();
			solve(out, sc);
			out.flush();
			out.close();
			}
			catch (Exception e) {
				e.printStackTrace();

			}
		}

		void solve(PrintWriter out, MyScanner sc) throws IOException{

			StringBuilder a = new StringBuilder(sc.nextLine());
			StringBuilder b = new StringBuilder(sc.nextLine());

			int i = 0;
			for(; i < a.length() ; ++i) {
				if(a.charAt(i) != '0') break;
			}
			a.delete(0, i);
			i = 0;
			for(; i < b.length(); ++i) {
				if(b.charAt(i) != '0') break;
			}
			b.delete(0, i);
		//	if(a.length() == 0) a.append("0");
		//	if(b.length() == 0) b.append("0");

			if(a.length() > b.length()) out.print(">");
			else if(b.length() > a.length()) out.println("<");
			else {
				for(i = 0; i < a.length() ; ++i) {
					if(a.charAt(i) > b.charAt(i)) { out.println(">"); return;}
					else if(b.charAt(i) > a.charAt(i)) { out.println("<"); return;}
				}
				out.println("=");
			}

		}

}

class MyScanner {
    BufferedReader br;
    StringTokenizer st;

    public MyScanner() {
       br = new BufferedReader(new InputStreamReader(System.in));
    }

    String next() {
        while (st == null || !st.hasMoreElements()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }

    int nextInt() { return Integer.parseInt(next());}

    long nextLong() {return Long.parseLong(next());}

    double nextDouble() {return Double.parseDouble(next());}

    String nextLine(){
        String str = "";
	  try {
	     str = br.readLine();
	  } catch (IOException e) {
	     e.printStackTrace();
	  }
	  return str;
    }

}


import java.beans.Visibility;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.Stack;
import java.util.StringTokenizer;

public class Main implements Runnable{

		 public static void main(String[] args) throws IOException {
			new Thread(null , new Main(),"Main", 1<<26).start();

		 }

		public void run(){
			try {
			PrintWriter out = new PrintWriter(System.out);
			MyScanner sc = new MyScanner();
			solve(out, sc);
			out.flush();
			out.close();
			}
			catch (Exception e) {
				e.printStackTrace();

			}
		}

		void solve(PrintWriter out, MyScanner sc) throws IOException{

			StringBuilder a = new StringBuilder(sc.nextLine());
			StringBuilder b = new StringBuilder(sc.nextLine());

			int i = 0;
			for(; i < a.length() ; ++i) {
				if(a.charAt(i) != '0') break;
			}
			a.delete(0, i);
			i = 0;
			for(; i < b.length(); ++i) {
				if(b.charAt(i) != '0') break;
			}
			b.delete(0, i);
			if(a.length() == 0) a.append("0");
			if(b.length() == 0) b.append("0");

			if(a.length() > b.length()) out.print(">");
			else if(b.length() > a.length()) out.println("<");
			else {
				for(i = 0; i < a.length() ; ++i) {
					if(a.charAt(i) > b.charAt(i)) { out.println(">"); return;}
					else if(b.charAt(i) > a.charAt(i)) { out.println("<"); return;}
				}
				out.println("=");
			}

		}

}

class MyScanner {
    BufferedReader br;
    StringTokenizer st;

    public MyScanner() {
       br = new BufferedReader(new InputStreamReader(System.in));
    }

    String next() {
        while (st == null || !st.hasMoreElements()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }

    int nextInt() { return Integer.parseInt(next());}

    long nextLong() {return Long.parseLong(next());}

    double nextDouble() {return Double.parseDouble(next());}

    String nextLine(){
        String str = "";
	  try {
	     str = br.readLine();
	  } catch (IOException e) {
	     e.printStackTrace();
	  }
	  return str;
    }

}


import java.beans.Visibility;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.Stack;
import java.util.StringTokenizer;

public class Main implements Runnable{

		 public static void main(String[] args) throws IOException {
			new Thread(null , new Main(),"Main", 1<<26).start();

		 }

		public void run(){
			try {
			PrintWriter out = new PrintWriter(System.out);
			MyScanner sc = new MyScanner();
			solve(out, sc);
			out.flush();
			out.close();
			}
			catch (Exception e) {
				e.printStackTrace();

			}
		}

		void solve(PrintWriter out, MyScanner sc) throws IOException{

			StringBuilder a = new StringBuilder(sc.next());
			StringBuilder b = new StringBuilder(sc.next());

			for(int i = 0 ; i < a.length() ; ++i) {
				if(a.charAt(i) != '0') break;
				else a.deleteCharAt(i);--i;
			}

			for(int i = 0; i < b.length(); ++i) {
				if(b.charAt(i) != '0') break;
				else b.deleteCharAt(i);--i;
			}

			if(a.length() > b.length()) out.print(">");
			else if(b.length() > a.length()) out.println("<");
			else {
				for(int i = 0; i < a.length() ; ++i) {
					if(a.charAt(i) > b.charAt(i)) { out.println(">"); return;}
					else if(b.charAt(i) > a.charAt(i)) { out.println("<"); return;}
				}
				out.println("=");
			}

		}

}

class MyScanner {
    BufferedReader br;
    StringTokenizer st;

    public MyScanner() {
       br = new BufferedReader(new InputStreamReader(System.in));
    }

    String next() {
        while (st == null || !st.hasMoreElements()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }

    int nextInt() { return Integer.parseInt(next());}

    long nextLong() {return Long.parseLong(next());}

    double nextDouble() {return Double.parseDouble(next());}

    String nextLine(){
        String str = "";
	  try {
	     str = br.readLine();
	  } catch (IOException e) {
	     e.printStackTrace();
	  }
	  return str;
    }

}


import java.beans.Visibility;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.Stack;
import java.util.StringTokenizer;

public class Main implements Runnable{

		 public static void main(String[] args) throws IOException {
			new Thread(null , new Main(),"Main", 1<<26).start();

		 }

		public void run(){
			try {
			PrintWriter out = new PrintWriter(System.out);
			MyScanner sc = new MyScanner();
			solve(out, sc);
			out.flush();
			out.close();
			}
			catch (Exception e) {
				e.printStackTrace();

			}
		}

		void solve(PrintWriter out, MyScanner sc) throws IOException{

			StringBuilder a = new StringBuilder(sc.nextLine());
			StringBuilder b = new StringBuilder(sc.nextLine());

			for(int i = 0 ; i < a.length() ; ++i) {
				if(a.charAt(i) != '0') break;
				else a.deleteCharAt(i);--i;
			}

			for(int i = 0; i < b.length(); ++i) {
				if(b.charAt(i) != '0') break;
				else b.deleteCharAt(i);--i;
			}

			if(a.length() > b.length()) out.print(">");
			else if(b.length() > a.length()) out.println("<");
			else {
				for(int i = 0; i < a.length() ; ++i) {
					if(a.charAt(i) > b.charAt(i)) { out.println(">"); return;}
					else if(b.charAt(i) > a.charAt(i)) { out.println("<"); return;}
				}
				out.println("=");
			}

		}

}

class MyScanner {
    BufferedReader br;
    StringTokenizer st;

    public MyScanner() {
       br = new BufferedReader(new InputStreamReader(System.in));
    }

    String next() {
        while (st == null || !st.hasMoreElements()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }

    int nextInt() { return Integer.parseInt(next());}

    long nextLong() {return Long.parseLong(next());}

    double nextDouble() {return Double.parseDouble(next());}

    String nextLine(){
        String str = "";
	  try {
	     str = br.readLine();
	  } catch (IOException e) {
	     e.printStackTrace();
	  }
	  return str;
    }

}


import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Scanner;

public class Main {

	static Scanner sc = new Scanner(System.in);
	static long a, b;

	public static void main(String[] args) throws FileNotFoundException{
		String num1 = sc.nextLine();
		String num2 = sc.nextLine();

		a = Long.valueOf(num1);
		b = Long.valueOf(num2);

		if (a > b) {System.out.println(">");}
		if (a == b) {System.out.println("=");}
		if (a < b) {System.out.println("<");}
	}
}


import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Scanner;

public class Main {

	static Scanner sc = new Scanner(System.in);

	public static void main(String[] args) throws FileNotFoundException{
		String str1 = sc.nextLine();
		String str2 = sc.nextLine();

		int i;
		for (i = 0; i <= str1.length(); i++) {
			if (i == str1.length() || str1.charAt(i) != '0') break;
		}
		int j;
		for (j = 0; j <= str2.length(); j++) {
			if (j == str2.length() || str2.charAt(j) != '0') break;
		}

		if (str1.length() - i > str2.length() - j) {System.out.println(">"); return;}
		if (str1.length() - i < str2.length() - j) {System.out.println("<"); return;}

		for (int a = 0; a < str1.length() - i; a++) {
			if (Integer.valueOf(str1.charAt(i + a)) > Integer.valueOf(str2.charAt(j + a))) {System.out.println(">"); return;}
			if (Integer.valueOf(str1.charAt(i + a)) < Integer.valueOf(str2.charAt(j + a))) {System.out.println("<"); return;}
		}

		System.out.println("=");
	}
}


import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Scanner;

public class Main {

	static Scanner sc = new Scanner(System.in);

	public static void main(String[] args) throws FileNotFoundException{
		String num1 = sc.nextLine();
		String num2 = sc.nextLine();

		boolean b1 = false;
		boolean b2 = false;
		for (int i = 0; i < Math.max(num1.length(), num2.length()); i++) {
			if (num1.charAt(0) != '0' && num2.charAt(0) != '0') break;

			if (num1.charAt(0) == '0') num1 = num1.substring(1);
			if (num2.charAt(0) == '0') num2 = num2.substring(1);
		}

		if (num1.length() > num2.length()){System.out.println(">"); return;}
		if (num1.length() < num2.length()) {System.out.println("<"); return;}

		for (int i = 0; i < num1.length(); i++) {
			if (num1.charAt(i) == num2.charAt(i)) continue;

			if (Integer.valueOf(num1.charAt(i)) > Integer.valueOf(num2.charAt(i))) {System.out.println(">"); return;}
			else {System.out.println("<"); return;}
		}

		System.out.println("=");
	}
}


import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Scanner;

public class Main {

	static Scanner sc = new Scanner(System.in);
	static long a, b;

	public static void main(String[] args) {
		a = sc.nextLong();
		b = sc.nextLong();

		if (a > b) {System.out.println(">");}
		if (a == b) {System.out.println("=");}
		if (a < b) {System.out.println("<");}
	}
}


import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Scanner;

public class Main {

	static Scanner sc = new Scanner(System.in);

	public static void main(String[] args) throws FileNotFoundException{
		String num1 = sc.nextLine();
		String num2 = sc.nextLine();

		boolean b1 = false;
		boolean b2 = false;
		for (int i = 0; i < Math.max(num1.length(), num2.length()); i++) {
			if (num1.charAt(0) != '0' && num2.charAt(0) != '0') break;

			if (num1.length() != 0) {
				if (num1.charAt(0) == '0') {
					num1 = num1.substring(1);
				}
			}
			if (num2.length() != 0) {
				if (num2.charAt(0) == '0') {
					num2 = num2.substring(1);
				}
			}
		}

		if (num1.equals("0")) num1 = "";
		if (num2.equals("0")) num2 = "";

		if (num1.length() > num2.length()){System.out.println(">"); return;}
		if (num1.length() < num2.length()) {System.out.println("<"); return;}

		for (int i = 0; i < num1.length(); i++) {
			if (num1.charAt(i) == num2.charAt(i)) continue;

			if (Integer.valueOf(num1.charAt(i)) > Integer.valueOf(num2.charAt(i))) {System.out.println(">"); return;}
			else {System.out.println("<"); return;}
		}

		System.out.println("=");
	}
}


import java.util.*;
import java.io.*;
import java.math.*;
public class Main
{
	public static void main(String[]args)throws IOException
	{
		BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
		String a =( bf.readLine());
		String b = (bf.readLine());
		PrintWriter out = new PrintWriter(System.out);
		int la = a.length();
		int lb = b.length();
		for (int i = 0; i < la; i++)
		{
			if(a.charAt(0) =='0')
				a = a.substring(1,a.length());
			else
				break;
		}
		for (int i = 0; i < lb; i++)
		{
			if(b.charAt(0) =='0')
				b = b.substring(1,b.length());
			else
				break;
		}

		if(a.length() > b.length())
			out.append('>');
		else
			if(a.length() < b.length())
				out.append('<');
			else{
				boolean flag = false;

				for (int i = 0;  i< a.length(); i++)
				{
					if(a.charAt(i)>b.charAt(i))
					{
						out.append('>');
						flag = true;
						break;
					}
					if(a.charAt(i) < b.charAt(i))
					{
						out.append('<');
						flag = true;
						break;
					}

				}
				if(!flag)
					out.append('=');
			}
		out.flush();
		out.close();
	}

}


import java.util.*;
import java.io.*;
public class Main
{
	public static void main(String[]args)throws IOException
	{
		BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
		long a = Long.parseLong(bf.readLine());
		long b = Long.parseLong(bf.readLine());
		PrintWriter out = new PrintWriter(System.out);
		if(a > b)
			out.append('>');
		else
			if(a < b)
				out.append('<');
			else
				if(a == b)
					out.append('=');
		out.flush();
		out.close();
	}

}


import java.util.*;
import java.io.*;
import java.math.*;
public class Main
{
	public static void main(String[]args)throws IOException
	{
		BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
		BigInteger a =new BigInteger( bf.readLine());
		BigInteger b = new BigInteger(bf.readLine());
		PrintWriter out = new PrintWriter(System.out);
		if(a.compareTo(b) > 0)
			out.append('>');
		else
			if(a.compareTo(b) < 0)
				out.append('<');
			else
				if(a.compareTo(b)==0)
					out.append('=');
		out.flush();
		out.close();
	}

}


import java.util.*;
import java.io.*;
import java.math.*;
public class Main
{
	public static void main(String[]args)throws IOException
	{
		BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
		String a =( bf.readLine());
		String b = (bf.readLine());
		PrintWriter out = new PrintWriter(System.out);
		for (int i = 0; i < a.length(); i++)
		{
			if(a.charAt(i) =='0')
				a = a.substring(i+1,a.length());
			else
				break;
		}
		for (int i = 0; i < b.length(); i++)
		{
			if(b.charAt(i) =='0')
				b = b.substring(i+1,b.length());
			else
				break;
		}
		if(a.length() > b.length())
			out.append('>');
		else
			if(a.length() < b.length())
				out.append('<');
			else{
				boolean flag = false;

				for (int i = 0;  i< a.length(); i++)
				{
					if(a.charAt(i)>b.charAt(i))
					{
						out.append('>');
						flag = true;
						break;
					}
					if(a.charAt(i) < b.charAt(i))
					{
						out.append('<');
						flag = true;
						break;
					}

				}
				if(!flag)
					out.append('=');
			}
		out.flush();
		out.close();
	}

}


import java.util.*;
import java.io.*;
import java.math.*;
public class CompareTwoLongInt
{
	public static void main(String[]args)throws IOException
	{
		BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
		char [] a =( bf.readLine()).toCharArray();
		char [] b = (bf.readLine()).toCharArray();
		PrintWriter out = new PrintWriter(System.out);
		int la = a.length;
		int lb = b.length;
		int starta = 0, startb = 0;
		for (int i = 0; i < la; i++)
		{
			if(a[i] =='0')
				starta++;
			else
				break;
		}
		for (int i = 0; i < lb; i++)
		{
			if(b[i] =='0')
				startb++;
			else
				break;
		}

		if(la - starta > lb - startb)
			out.append('>');
		else
			if(la - starta < lb - startb)
				out.append('<');
			else{
				boolean flag = false;
				for (int i = starta, j = startb;  i< la; i++, j++)
				{
					if(a[i]>b[j])
					{
						out.append('>');
						flag = true;
						break;
					}
					if(a[i] < b[j])
					{
						out.append('<');
						flag = true;
						break;
					}

				}
				if(!flag)
					out.append('=');
			}
		out.flush();
		out.close();
	}

}


import java.util.*;
import java.io.*;
import java.math.*;
public class CompareTwoLongInt
{
	public static void main(String[]args)throws IOException
	{
		BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
		char [] a =( bf.readLine()).toCharArray();
		char [] b = (bf.readLine()).toCharArray();
		PrintWriter out = new PrintWriter(System.out);
		int la = a.length;
		int lb = b.length;
		int starta = 0, startb = 0;
		for (int i = 0; i < la; i++)
		{
			if(a[i] =='0')
				starta++;
			else
				break;
		}
		for (int i = 0; i < lb; i++)
		{
			if(b[i] =='0')
				startb++;
			else
				break;
		}

		if(la - starta > lb - startb)
			out.append('>');
		else
			if(la - starta < lb - startb)
				out.append('<');
			else{
				boolean flag = false;

				for (int i = starta, j = startb;  i< la-starta; i++, j++)
				{
					if(a[i]>b[j])
					{
						out.append('>');
						flag = true;
						break;
					}
					if(a[i] < b[j])
					{
						out.append('<');
						flag = true;
						break;
					}

				}
				if(!flag)
					out.append('=');
			}
		out.flush();
		out.close();
	}

}


import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.math.BigInteger;

/**
 * 10/29/16 11:18 AM.
 */
public class Four {
    public static void main(String[] args) throws Exception{
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        String f = reader.readLine().replaceFirst("^0+", "");
        String g = reader.readLine().replaceFirst("^0+", "");
        f = (f.length() == 0) ? "0" : f;
        g = (g.length() == 0) ? "0" : g;

        if(f.length() == g.length()) {
            if (f.compareTo(g) < 0) {
                System.out.println("<");
            } else if (f.compareTo(g) > 0) {
                System.out.println(">");
            } else {
                System.out.println("=");
            }
        } else {
            if(f.length() < g.length()) {
                System.out.println("<");
            } else {
                System.out.println(">");
            }
        }
    }
}


import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.math.BigInteger;

/**
 * 10/29/16 11:18 AM.
 */
public class Four {
    public static void main(String[] args) throws Exception{
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        String f = reader.readLine().replaceFirst("^0+", "");
        String g = reader.readLine().replaceFirst("^0+", "");
        f = (f.length() == 0) ? "0" : f;
        g = (g.length() == 0) ? "0" : g;
        BigInteger a = new BigInteger(f);
        BigInteger b = new BigInteger(g);

        if(f.length() == g.length()) {
            if (a.compareTo(b) < 0) {
                System.out.println("<");
            } else if (a.compareTo(b) > 0) {
                System.out.println(">");
            } else {
                System.out.println("=");
            }
        } else {
            if(f.length() < g.length()) {
                System.out.println("<");
            } else {
                System.out.println(">");
            }
        }
    }
}


import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.math.BigInteger;

/**
 * 10/29/16 11:18 AM.
 */
public class Four {
    public static void main(String[] args) throws Exception{
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        String f = reader.readLine().replaceFirst("^0+", "");
        String g = reader.readLine().replaceFirst("^0+", "");
        f = (f.length() == 0) ? "0" : f;
        g = (g.length() == 0) ? "0" : f;
        BigInteger a = new BigInteger(f);
        BigInteger b = new BigInteger(g);

        if(a.compareTo(b) < 0) {
            System.out.println("<");
        } else if(a.compareTo(b) > 0) {
            System.out.println(">");
        } else {
            System.out.println("=");
        }
    }
}


import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.math.BigInteger;

/**
 * 10/29/16 11:18 AM.
 */
public class Four {
    public static void main(String[] args) throws Exception{
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        String f = reader.readLine().replaceFirst("^0+", "");
        String g = reader.readLine().replaceFirst("^0+", "");
        f = (f.length() == 0) ? "0" : f;
        g = (g.length() == 0) ? "0" : f;
        BigInteger a = new BigInteger(f);
        BigInteger b = new BigInteger(g);

        if(f.length() == g.length()) {
            if (a.compareTo(b) < 0) {
                System.out.println("<");
            } else if (a.compareTo(b) > 0) {
                System.out.println(">");
            } else {
                System.out.println("=");
            }
        } else {
            if(f.length() < g.length()) {
                System.out.println("<");
            } else {
                System.out.println(">");
            }
        }
    }
}


import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.math.BigInteger;
import java.util.Scanner;

/**
 * 10/29/16 11:18 AM.
 */
public class Four {
    public static void main(String[] args) throws Exception{
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        String f = reader.readLine().replaceFirst("^0+", "");
        String g = reader.readLine().replaceFirst("^0+", "");
        BigInteger a = new BigInteger(f);
        BigInteger b = new BigInteger(g);

        if(a.compareTo(b) < 0) {
            System.out.println("<");
        } else if(a.compareTo(b) > 0) {
            System.out.println(">");
        } else {
            System.out.println("=");
        }
    }
}


import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.math.BigInteger;

/**
 * 10/29/16 11:18 AM.
 */
public class Four {
    public static void main(String[] args) throws Exception{
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        String f = reader.readLine().replaceFirst("^0+", "");
        String g = reader.readLine().replaceFirst("^0+", "");
        f = (f.length() == 0) ? "0" : f;
        g = (g.length() == 0) ? "0" : g;
        BigInteger a = new BigInteger(f);
        BigInteger b = new BigInteger(g);

        if(a.compareTo(b) < 0) {
            System.out.println("<");
        } else if(a.compareTo(b) > 0) {
            System.out.println(">");
        } else {
            System.out.println("=");
        }
    }
}


import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.math.BigInteger;
import java.util.Scanner;

/**
 * 10/29/16 11:18 AM.
 */
public class Four {
    public static void main(String[] args) throws Exception{
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        BigInteger a = new BigInteger(reader.readLine());
        BigInteger b = new BigInteger(reader.readLine());

        if(a.compareTo(b) < 0) {
            System.out.println("<");
        } else if(a.compareTo(b) > 0) {
            System.out.println(">");
        } else {
            System.out.println("=");
        }
    }
}


import java.math.BigInteger;
import java.util.Scanner;

/**
 * 10/29/16 11:18 AM.
 */
public class Four {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        BigInteger a = new BigInteger(scan.nextLine());
        BigInteger b = new BigInteger(scan.nextLine());

        if(a.compareTo(b) < 0) {
            System.out.println("<");
        } else if(a.compareTo(b) > 0) {
            System.out.println(">");
        } else {
            System.out.println("=");
        }
    }
}


import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;

public class Two_Long_Integers {
	public static void main(String[] args)throws Throwable {
		BufferedReader bf = new BufferedReader(new InputStreamReader (System.in));
		PrintWriter pw = new PrintWriter(System.out, true);
		String int1=bf.readLine();
		String int2=bf.readLine();
		int1=removezeros(int1);
		int2=removezeros(int2);
		if(int1.length()>int2.length())
			pw.print(">");
		else if (int1.length()<int2.length())
			pw.print("<");
		else
		{
		for(int i=0;i!=int1.length();i++)
		{
			if(int1.charAt(i)>int2.charAt(i))
			{
				pw.print(">");
				break;
			}
			else if(int1.charAt(i)<int2.charAt(i))
			{
				pw.print("<");
				break;
			}
			else if(i==int1.length()-1)
				pw.print("=");
		}
		}
		pw.close();
	}
	public static String removezeros(String a)
	{
		while(a.length()>1 && a.charAt(0)=='0')
		{
			a=a.substring(1);
		}
		return a;
	}
}


import java.io.PrintWriter;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class TwoLongInts {

    public static void main(String[] args) throws IOException
    {
    	BufferedReader bf= new BufferedReader(new InputStreamReader(System.in));
    	PrintWriter pw = new PrintWriter(System.out,true);
    	long a = Long.parseLong(bf.readLine());
    	long b = Long.parseLong(bf.readLine());
    	if (a>b)
    	pw.println(">");
    	else if (a<b)
    	pw.println("<");
    	else
    	pw.println("=");
    }

}


import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;

public class Two_Long_Integers {
	public static void main(String[] args)throws Throwable {
		BufferedReader bf = new BufferedReader(new InputStreamReader (System.in));
		PrintWriter pw = new PrintWriter(System.out, true);
		String int1=bf.readLine();
		String int2=bf.readLine();
		int1=removezeros(int1);
		int2=removezeros(int2);
		if(int1.length()>int2.length())
			pw.print(">");
		else if (int1.length()<int2.length())
			pw.print("<");
		else
		{
		for(int i=0;i!=int1.length();i++)
		{
			if(int1.charAt(i)>int2.charAt(i))
			{
				pw.print(">");
				break;
			}
			else if(int1.charAt(i)<int2.charAt(i))
			{
				pw.print("<");
				break;
			}
			else if(i==int1.length()-1)
				pw.print("=");
		}
		}
		pw.close();
	}
	public static String removezeros(String a)
	{
		int count=1;
		if(a.length()==1)
			return a;
		else if(a.charAt(0)=='0')
		{
			for(int i=1;i!=a.length();i++)
			{
				if(a.charAt(i)!='0' || count==a.length()-1)
					break;
				else
					count++;
			}
			return a.substring(count);
		}
		return a;
	}
}


import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;

public class Two_Long_Integers {
	public static void main(String[] args)throws Throwable {
		BufferedReader bf = new BufferedReader(new InputStreamReader (System.in));
		PrintWriter pw = new PrintWriter(System.out, true);
		String int1=bf.readLine();
		String int2=bf.readLine();
		if(int1.length()>int2.length())
			pw.print(">");
		else if (int1.length()<int2.length())
			pw.print("<");
		else
		{
		for(int i=0;i!=int1.length();i++)
		{
			if(int1.charAt(i)>int2.charAt(i))
			{
				pw.print(">");
				break;
			}
			else if(int1.charAt(i)<int2.charAt(i))
			{
				pw.print("<");
				break;
			}
			else if(i==int1.length()-1)
				pw.print("=");
		}
		}
		pw.close();
	}
}


import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;

public class Two_Long_Integers {
	public static void main(String[] args)throws Throwable {
		BufferedReader bf = new BufferedReader(new InputStreamReader (System.in));
		PrintWriter pw = new PrintWriter(System.out, true);
		String int1=bf.readLine();
		String int2=bf.readLine();
		if(int1.charAt(0)=='0')
			int1=removezeros(int1);
		if(int2.charAt(0)=='0')
			int2=removezeros(int2);
		if(int1.length()>int2.length())
			pw.print(">");
		else if (int1.length()<int2.length())
			pw.print("<");
		else
		{
		for(int i=0;i!=int1.length();i++)
		{
			if(int1.charAt(i)>int2.charAt(i))
			{
				pw.print(">");
				break;
			}
			else if(int1.charAt(i)<int2.charAt(i))
			{
				pw.print("<");
				break;
			}
			else if(i==int1.length()-1)
				pw.print("=");
		}
		}
		pw.close();
	}
	public static String removezeros(String a)
	{
		int count=1;
		for(int i=1;i!=a.length();i++)
		{
			if(a.charAt(i)=='0')
				count++;
		}
		return a.substring(count);
	}
}


import java.io.PrintWriter;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class TwoLongInts {

    public static void main(String[] args) throws IOException
    {
    	BufferedReader bf= new BufferedReader(new InputStreamReader(System.in));
    	PrintWriter pw = new PrintWriter(System.out,true);
    	double a = Double.parseDouble(bf.readLine());
    	double b = Double.parseDouble(bf.readLine());
    	if (a>b)
    	pw.println(">");
    	else if (a<b)
    	pw.println("<");
    	else
    	pw.println("=");
    }

}


import java.io.*;
import java.math.BigInteger;
import java.util.StringTokenizer;

/**
 * Created by WiNDWAY on 4/26/16.
 */

public class Codeforces_Educational_round_5_ComparingTwoLongIntegers {

    public static void main(String[] args) {
        FScanner input = new FScanner();
        out = new PrintWriter(new BufferedOutputStream(System.out), true);
        String first = input.nextLine().replaceFirst("^0+(?!$)", "");
        String second = input.nextLine().replaceFirst("^0+(?!$)", "");
        if(first.length() > second.length()) {
            System.out.println(">");
            System.exit(0);
        } else if(first.length() < second.length()) {
            System.out.printf("<");
            System.exit(0);
        } else {
            for (int i = 0; i < first.length(); i++) {
                char a = first.charAt(i);
                char b = second.charAt(i);
                if(a == b) {
                    continue;
                } else if(a > b) {
                    System.out.println(">");
                    System.exit(0);
                } else {
                    System.out.println("<");
                    System.exit(0);
                }
            }
        }
        System.out.println("=");
        out.close();
    }

    public static PrintWriter out;

    public static class FScanner {
        BufferedReader br;
        StringTokenizer st;

        public FScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        private String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

        public double nextDouble() {
            return Double.parseDouble(next());
        }

        public String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }

    }
}


import java.io.*;
import java.math.BigInteger;
import java.util.StringTokenizer;

/**
 * Created by WiNDWAY on 4/26/16.
 */

public class Codeforces_Educational_round_5_ComparingTwoLongIntegers {

    public static void main(String[] args) {
        FScanner input = new FScanner();
        out = new PrintWriter(new BufferedOutputStream(System.out), true);
        BigInteger a = new BigInteger(input.nextLine());
        BigInteger b = new BigInteger(input.nextLine());
        if(a.compareTo(b) == 0) {
            System.out.println("=");
        } else {
            System.out.println(a.compareTo(b) == 1 ? ">" : "<");
        }
        out.close();
    }

    public static PrintWriter out;

    public static class FScanner {
        BufferedReader br;
        StringTokenizer st;

        public FScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        private String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

        public double nextDouble() {
            return Double.parseDouble(next());
        }

        public String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }

    }
}


import java.io.*;
import java.math.BigInteger;
import java.util.StringTokenizer;

/**
 * Created by WiNDWAY on 4/26/16.
 */

public class Codeforces_Educational_round_5_ComparingTwoLongIntegers {

    public static void main(String[] args) {
        FScanner input = new FScanner();
        out = new PrintWriter(new BufferedOutputStream(System.out), true);
        String first = input.nextLine().replaceFirst("^0+(?!$)", "");
        String second = input.nextLine().replaceFirst("^0+(?!$)", "");
        if(first.length() > second.length()) {
            System.out.println(">");
        } else if(first.length() < second.length()) {
            System.out.printf("<");
        } else {
            for (int i = 0; i < first.length(); i++) {
                char a = first.charAt(i);
                char b = second.charAt(i);
                if(a == b) {
                    continue;
                } else if(a > b) {
                    System.out.println(">");
                    System.exit(0);
                } else {
                    System.out.println("<");
                    System.exit(0);
                }
            }
        }
        System.out.println("=");
        out.close();
    }

    public static PrintWriter out;

    public static class FScanner {
        BufferedReader br;
        StringTokenizer st;

        public FScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        private String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

        public double nextDouble() {
            return Double.parseDouble(next());
        }

        public String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }

    }
}


import java.io.*;
import java.math.BigInteger;
import java.util.StringTokenizer;

/**
 * Created by WiNDWAY on 4/26/16.
 */

public class Codeforces_Educational_round_5_ComparingTwoLongIntegers {

    public static void main(String[] args) {
        FScanner input = new FScanner();
        out = new PrintWriter(new BufferedOutputStream(System.out), true);
        String first = input.nextLine().replaceFirst("^0+(?!$)", "");
        String second = input.nextLine().replaceFirst("^0+(?!$)", "");
        if(first.length() > second.length()) {
            System.out.println(">");
        } else if(first.length() < second.length()) {
            System.out.printf("<");
        } else {
            for (int i = 0; i < first.length(); i++) {
                char a = first.charAt(i);
                char b = second.charAt(i);
                if(a == b) {
                    continue;
                } else if(a > b) {
                    System.out.println(">");
                    System.exit(0);
                } else {
                    System.out.println("<");
                    System.exit(0);
                }
            }
        }
        out.close();
    }

    public static PrintWriter out;

    public static class FScanner {
        BufferedReader br;
        StringTokenizer st;

        public FScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        private String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

        public double nextDouble() {
            return Double.parseDouble(next());
        }

        public String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }

    }
}


import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		StringBuilder a = new StringBuilder();
		StringBuilder b = new StringBuilder();
		a = a.append(scan.nextLine());
		b = b.append(scan.nextLine());
		myTrim(a);
		myTrim(b);
		if (a.length() > b.length())
			System.out.println(">");
		else if (a.length() < b.length())
			System.out.println("<");
		else
			System.out.println(whenEqual(a, b));
		scan.close();
	}

	public static void myTrim(StringBuilder a) {
		if (a.charAt(0) != '0')
			return;
		a.deleteCharAt(0);
		myTrim(a);
	}

	public static String whenEqual(StringBuilder a, StringBuilder b) {
		for (int i = 0; i < a.length(); i++) {
			if (a.charAt(i) < b.charAt(i))
				return "<";
			if (a.charAt(i) > b.charAt(i))
				return ">";
		}
		return "=";
	}
}


import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		StringBuilder a = new StringBuilder();
		StringBuilder b = new StringBuilder();
		a = a.append(scan.nextLine());
		b = b.append(scan.nextLine());
		myTrim(a);
		myTrim(b);
		if (a.length() > b.length())
			System.out.println(">");
		else if (a.length() < b.length())
			System.out.println("<");
		else
			System.out.println(whenEqual(a, b));
		scan.close();
	}

	public static void myTrim(StringBuilder a) {
		if (a.charAt(0) != '0')
			return;
		a.deleteCharAt(0);
		if (a.length() != 0)
			myTrim(a);
	}

	public static String whenEqual(StringBuilder a, StringBuilder b) {
		for (int i = 0; i < a.length(); i++) {
			if (a.charAt(i) < b.charAt(i))
				return "<";
			if (a.charAt(i) > b.charAt(i))
				return ">";
		}
		return "=";
	}
}


import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		StringBuilder a = new StringBuilder();
		StringBuilder b = new StringBuilder();
		a = a.append(scan.nextLine());
		b = b.append(scan.nextLine());
		myTrim(a);
		myTrim(b);
		if (a.length() > b.length())
			System.out.println(">");
		else if (a.length() < b.length())
			System.out.println("<");
		else {
			int x = a.toString().compareTo(b.toString());
			if (x == 0)
				System.out.println("=");
			else if (x < 0)
				System.out.println("<");
			else
				System.out.println(">");
		}
		scan.close();
	}

	public static void myTrim(StringBuilder a) {
		while (a.length() > 0 && a.charAt(0) == '0')
			a.deleteCharAt(0);
	}
	//
	// public static String whenEqual(StringBuilder a, StringBuilder b) {
	// for (int i = 0; i < a.length(); i++) {
	// if (a.charAt(i) < b.charAt(i))
	// return "<";
	// if (a.charAt(i) > b.charAt(i))
	// return ">";
	// }
	// return "=";
	// }
}


import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		StringBuilder a = new StringBuilder();
		StringBuilder b = new StringBuilder();
		a = a.append(scan.nextLine());
		b = b.append(scan.nextLine());
		String a2 = myTrim(a);
		String b2 = myTrim(b);
		if (a2.length() > b2.length())
			System.out.println(">");
		else if (a2.length() < b2.length())
			System.out.println("<");
		else {
			int x = a2.compareTo(b2);
			if (x == 0)
				System.out.println("=");
			else if (x < 0)
				System.out.println("<");
			else
				System.out.println(">");
		}
		scan.close();
	}

	public static String myTrim(StringBuilder a) {
		int idx = 0;
		while (idx < a.length() && a.charAt(idx) == '0')
			idx++;
		return a.substring(idx);
	}
	//
	// public static String whenEqual(StringBuilder a, StringBuilder b) {
	// for (int i = 0; i < a.length(); i++) {
	// if (a.charAt(i) < b.charAt(i))
	// return "<";
	// if (a.charAt(i) > b.charAt(i))
	// return ">";
	// }
	// return "=";
	// }
}


import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		StringBuilder a = new StringBuilder();
		StringBuilder b = new StringBuilder();
		a = a.append(scan.nextLine());
		b = b.append(scan.nextLine());
		myTrim(a);
		myTrim(b);
		if (a.length() > b.length())
			System.out.println(">");
		else if (a.length() < b.length())
			System.out.println("<");
		else{
			int x = a.toString().compareTo(b.toString());
			if(x==0)
				System.out.println("=");
			else if(x<0)
				System.out.println("<");
			else
				System.out.println(">");
		}
		scan.close();
	}

	public static void myTrim(StringBuilder a) {
		if (a.charAt(0) != '0')
			return;
		a.deleteCharAt(0);
		if (a.length() != 0)
			myTrim(a);
	}
//
//	public static String whenEqual(StringBuilder a, StringBuilder b) {
//		for (int i = 0; i < a.length(); i++) {
//			if (a.charAt(i) < b.charAt(i))
//				return "<";
//			if (a.charAt(i) > b.charAt(i))
//				return ">";
//		}
//		return "=";
//	}
}


//package CodeForces.EducationalRound5;

import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

/**
 * Created by ilya on 11.01.16.
 */

public class A616 {
    public static void main(String[] args) {
        sc sc = new sc();
        PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
        long a = sc.nextLong();
        long b = sc.nextLong();
        boolean t = a < b;
        boolean r = a == b;
        out.println(t?"<":r?"=":">");
        out.close();
    }

    public static class sc {
        BufferedReader br;
        StringTokenizer st;

        public sc() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        Integer nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }

}


//package CodeForces.EducationalRound5;

import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.StringTokenizer;

/**
 * Created by ilya on 11.01.16.
 */

public class A616 {
    public static void main(String[] args) {
        sc sc = new sc();
        PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
        String a = sc.next();
        String b = sc.next();
        int z = 0, k = 0;
        while(a.charAt(z) == '0') z++;
        while(b.charAt(k) == '0') k++;
        if (a.length() - z < b.length() - k){
            out.println("<");
            out.close();
            return;
        }
        else if (a.length() - z > b.length() - k){
            out.println(">");
            out.close();
            return;
        }
        else {
            for (int i = 0; i < Math.min(a.length() - z, b.length() - k); i++) {
                if (a.charAt(z + i) < b.charAt(k + i)) {
                    out.println("<");
                    out.close();
                    return;
                }
                if (a.charAt(z + i) > b.charAt(k + i)) {
                    out.println(">");
                    out.close();
                    return;
                }
            }
        }
        out.println("=");
        out.close();
    }

    public static class sc {
        BufferedReader br;
        StringTokenizer st;

        public sc() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        Integer nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }

}


//package CodeForces.EducationalRound5;

import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.StringTokenizer;

/**
 * Created by ilya on 11.01.16.
 */

public class A616 {
    public static void main(String[] args) {
        sc sc = new sc();
        PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
        String a = sc.next();
        String b = sc.next();
        int z = 0, k = 0;
        while(z < a.length() && a.charAt(z) == '0') z++;
        while(k < b.length() && b.charAt(k) == '0') k++;
        if (a.length() - z < b.length() - k){
            out.println("<");
            out.close();
            return;
        }
        else if (a.length() - z > b.length() - k){
            out.println(">");
            out.close();
            return;
        }
        else {
            for (int i = 0; i < Math.min(a.length() - z, b.length() - k); i++) {
                if (a.charAt(z + i) < b.charAt(k + i)) {
                    out.println("<");
                    out.close();
                    return;
                }
                if (a.charAt(z + i) > b.charAt(k + i)) {
                    out.println(">");
                    out.close();
                    return;
                }
            }
        }
        out.println("=");
        out.close();
    }

    public static class sc {
        BufferedReader br;
        StringTokenizer st;

        public sc() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        Integer nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }

}


//package CodeForces.EducationalRound5;

import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.StringTokenizer;

/**
 * Created by ilya on 11.01.16.
 */

public class A616 {
    public static void main(String[] args) {
        sc sc = new sc();
        PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
        String a = sc.next();
        String b = sc.next();
        int z = 0, k = 0;
        while(a.charAt(z) == '0') z++;
        while(b.charAt(k) == '0') k++;
        for (int i = 0; i < Math.min(a.length() - z, b.length() - k); i++) {
            if(a.charAt(z+i) < b.charAt(k+i)) {
                out.println("<");
                out.close();
                return;
            }
            if(a.charAt(z+i) > b.charAt(k+i)) {
                out.println(">");
                out.close();
                return;
            }
        }
        out.println("=");
        out.close();
    }

    public static class sc {
        BufferedReader br;
        StringTokenizer st;

        public sc() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        Integer nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }

}


//package CodeForces.EducationalRound5;

import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.StringTokenizer;

/**
 * Created by ilya on 11.01.16.
 */

public class A616 {
    public static void main(String[] args) {
        sc sc = new sc();
        PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
        String a = sc.next();
        String b = sc.next();
        int z = 0, k = 0;
        while(a.charAt(z) == '0') z++;
        while(b.charAt(k) == '0') k++;
        for (int i = 0; i < Math.min(a.length() - z, b.length() - k); i++) {
            if(a.charAt(z+i) < b.charAt(k+i)) {
                out.println("<");
                out.close();
                return;
            }
            if(a.charAt(z+i) > b.charAt(k+i)) {
                out.println("<");
                out.close();
                return;
            }
        }
        out.println("=");
        out.close();
    }

    public static class sc {
        BufferedReader br;
        StringTokenizer st;

        public sc() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        Integer nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }

}


//package CodeForces.EducationalRound5;

import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.StringTokenizer;

/**
 * Created by ilya on 11.01.16.
 */

public class A616 {
    public static void main(String[] args) {
        sc sc = new sc();
        PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
        BigInteger a = new BigInteger(sc.next());
        BigInteger b =new BigInteger(sc.next());
        boolean t = a.compareTo(b) < 0;
        boolean r = a.compareTo(b) == 0;
        out.println(t?"<":r?"=":">");
        out.close();
    }

    public static class sc {
        BufferedReader br;
        StringTokenizer st;

        public sc() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        Integer nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }

}


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class codeforces {
	public static void main(String[] args) throws IOException {

		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));

		StringTokenizer s1=new StringTokenizer(br.readLine());
		StringTokenizer s2= new StringTokenizer(br.readLine());

		String s11=s1.nextToken();
		String s22=s2.nextToken();

		int index1=0;
		int index2=0;
		int i1=0;
		while(s11.length()>i1&& s11.charAt(i1++)=='0' ){

			index1++;
		}
		s11=s11.substring(index1);
		int i2=0;
		while( s22.length()>i2 &&s22.charAt(i2++)=='0' ){
			index2++;
		}
		s22=s22.substring(index2);

		if(s22.length() >s11.length()){
			System.out.println("<");
		}else if(s22.length() <s11.length()){
			System.out.println(">");
		}else{
			for(int i=0;i<s11.length();i++){
				if(s11.charAt(i)>s22.charAt(i)){
					System.out.println(">");
					return;
				}
				if(s11.charAt(i)<s22.charAt(i)){
					System.out.println("<");
					return;
				}
			}
			System.out.println("=");
		}
	}

}


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class codeforces {
	public static void main(String[] args) throws IOException {

		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));

		StringTokenizer s1=new StringTokenizer(br.readLine());
		StringTokenizer s2= new StringTokenizer(br.readLine());

		String s11=s1.nextToken();
		String s22=s2.nextToken();

		int index1=0;
		int index2=0;
		int i1=0;
		while(s11.charAt(i1++)=='0' && s11.length()>1){

			index1++;
		}
		s11=s11.substring(index1);
		int i2=0;
		while(s22.charAt(i2++)=='0' && s22.length()>1){
			index2++;
		}
		s22=s22.substring(index2);

		if(s22.length() >s11.length()){
			System.out.println("<");
		}else if(s22.length() <s11.length()){
			System.out.println(">");
		}else{
			for(int i=0;i<s11.length();i++){
				if(s11.charAt(i)>s22.charAt(i)){
					System.out.println(">");
					return;
				}
				if(s11.charAt(i)<s22.charAt(i)){
					System.out.println("<");
					return;
				}
			}
			System.out.println("=");
		}
	}

}


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class codeforces {
	public static void main(String[] args) throws IOException {

		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));

		StringTokenizer s1=new StringTokenizer(br.readLine());
		StringTokenizer s2= new StringTokenizer(br.readLine());

		String s11=s1.nextToken();
		String s22=s2.nextToken();

		while(s11.charAt(0)=='0' && s11.length()>1){

			s11=s11.substring(1);
		}
		while(s22.charAt(0)=='0' && s22.length()>1){
			s22=s22.substring(1);
		}

		if(s22.length() >s11.length()){
			System.out.println("<");
		}else if(s22.length() <s11.length()){
			System.out.println(">");
		}else{
			for(int i=0;i<s11.length();i++){
				if(Integer.parseInt(s11.charAt(i)+"")>Integer.parseInt(s22.charAt(i)+"")){
					System.out.println(">");
					return;
				}
				if(Integer.parseInt(s11.charAt(i)+"")<Integer.parseInt(s22.charAt(i)+"")){
					System.out.println("<");
					return;
				}
			}
			System.out.println("=");
		}
	}

}


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class codeforces {
	public static void main(String[] args) throws IOException {

		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));

		StringTokenizer s1=new StringTokenizer(br.readLine());
		StringTokenizer s2= new StringTokenizer(br.readLine());

		String s11=s1.nextToken();
		String s22=s2.nextToken();

		while(s11.charAt(0)=='0'){
			s11=s11.substring(1);
		}
		while(s22.charAt(0)=='0'){
			s22=s22.substring(1);
		}

		if(s22.length() >s11.length()){
			System.out.println("<");
		}else if(s22.length() <s11.length()){
			System.out.println(">");
		}else{
			for(int i=0;i<s11.length();i++){
				if(Integer.parseInt(s11.charAt(0)+"")>Integer.parseInt(s22.charAt(0)+"")){
					System.out.println(">");
					return;
				}
				if(Integer.parseInt(s11.charAt(0)+"")<Integer.parseInt(s22.charAt(0)+"")){
					System.out.println("<");
					return;
				}
			}
			System.out.println("=");
		}
	}

}


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class codeforces {
	public static void main(String[] args) throws IOException {

		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));

		StringTokenizer s1=new StringTokenizer(br.readLine());
		StringTokenizer s2= new StringTokenizer(br.readLine());

		String s11=s1.nextToken();
		String s22=s2.nextToken();

		while(s11.charAt(0)=='0'){
			s11=s11.substring(1);
		}
		while(s22.charAt(0)=='0'){
			s22=s22.substring(1);
		}

		if(s22.length() >s11.length()){
			System.out.println("<");
		}else if(s22.length() <s11.length()){
			System.out.println(">");
		}else{
			for(int i=0;i<s11.length();i++){
				if(Integer.parseInt(s11.charAt(i)+"")>Integer.parseInt(s22.charAt(i)+"")){
					System.out.println(">");
					return;
				}
				if(Integer.parseInt(s11.charAt(i)+"")<Integer.parseInt(s22.charAt(i)+"")){
					System.out.println("<");
					return;
				}
			}
			System.out.println("=");
		}
	}

}


import java.util.Scanner;

public class codeforces {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		long a=sc.nextLong();
		long b=sc.nextLong();

		if(a==b){
			System.out.println("=");
		}
		else if(a>b)
			System.out.println(">");
		else
			System.out.println("<");

	}

}


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;

public class cf {

	public static void main(String[] args) throws IOException {
		//Scanner in = new Scanner(System.in);
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		String a = br.readLine();
		String b = br.readLine();
		int i=0;
		for (; i < a.length(); i++) {
			if(a.charAt(i) != '0')
				break;
		}
		a = a.substring(i);
		i=0;
		for (; i < b.length(); i++) {
			if(b.charAt(i) != '0')
				break;
		}
		b = b.substring(i);
		long dif = a.compareTo(b);
		if(dif == 0)
			System.out.println("=");
		else if(dif < 0)
			System.out.println(">");
		else
			System.out.println("<");
	}

}


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;

public class cf {

	public static void main(String[] args) throws IOException {
		//Scanner in = new Scanner(System.in);
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		BigInteger ba = new BigInteger(br.readLine());
		BigInteger bb = new BigInteger(br.readLine());
		long dif = ba.compareTo(bb);
		if(dif == 0)
			System.out.println("=");
		else if(dif > 0)
			System.out.println(">");
		else
			System.out.println("<");
	}

}


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;

public class cf {

	public static void main(String[] args) throws IOException {
		//Scanner in = new Scanner(System.in);
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		String a = br.readLine();
		String b = br.readLine();
		int i=0;
		for (; i < a.length(); i++) {
			if(a.charAt(i) != '0')
				break;
		}
		a = a.substring(i);
		BigInteger ba = new BigInteger(a);

		i=0;
		for (; i < b.length(); i++) {
			if(b.charAt(i) != '0')
				break;
		}
		b = b.substring(i);
		BigInteger bb = new BigInteger(b);

		if(ba.compareTo(bb) == 0)
			System.out.println("=");
		else if(ba.compareTo(bb) > 0)
			System.out.println(">");
		else
			System.out.println("<");
	}

}


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class cf {

	public static void main(String[] args) throws IOException {
		//Scanner in = new Scanner(System.in);
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int res =0;
		char a[] =( br.readLine()+"9").toCharArray();
		char b[] =( br.readLine()+"9").toCharArray();
		int j=0;
		int i =0;
		while(i <a.length && a[i] =='0')i++;
		while(j <b.length && b[j] =='0')j++;
		if(a.length -i > b.length - j)
			res =1;
		else if((a.length -i) <( b.length - j))
		res = -1;
		else
			for (; j < b.length; i++,j++) {
				if(a[i] > b[j]){
					res = 1;
					break;
				}else if(a[i] < b[j]){
					res =-1;
					break;
				}
			}

		if(res == 0)
			System.out.println("=");
		else if(res > 0)
			System.out.println(">");
		else
			System.out.println("<");
	}

}


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;

public class cf {

	public static void main(String[] args) throws IOException {
		//Scanner in = new Scanner(System.in);
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		BigInteger ba = new BigInteger(br.readLine());
		BigInteger bb = new BigInteger(br.readLine());

		if(ba.compareTo(bb) == 0)
			System.out.println("=");
		else if(ba.compareTo(bb) > 0)
			System.out.println(">");
		else
			System.out.println("<");
	}

}


import java.io.*;
import java.math.*;
public class compare{
    public static void main (String[] args){
try {
    BufferedReader inp = new BufferedReader(new InputStreamReader(System.in));
    String s1 = inp.readLine();
    BigInteger b1 = new BigInteger(s1);
    String s2 = inp.readLine();
    BigInteger b2 = new BigInteger(s2);

    int res = b1.compareTo(b2);

    if( res == 0 )
        System.out.println( "=" );
    else if( res == 1 )
        System.out.println( ">" );
    else if( res == -1 )
        System.out.println( "<" );

}
catch(IOException e){
    e.printStackTrace();

        }

    }
}


import java.io.*;
import java.math.*;
public class compare{
    public static void main (String[] args){
try {
    BufferedReader inp = new BufferedReader(new InputStreamReader(System.in));
    String s1 = inp.readLine().replaceFirst("^0+(?!$)", "");
    String s2 = inp.readLine().replaceFirst("^0+(?!$)", "");

    if(s1.length() == s2.length()){
        if(s1.compareTo(s2) > 0){
            System.out.println(">");
        }
        else if(s1.compareTo(s2) == 0){
            System.out.println("=");
        }
        else
            System.out.println("<");

    }
    else{
        if(s1.length() < s2.length()){
            System.out.println("<");
        }
        else{
            System.out.println(">");

        }

    }

}
catch(IOException e){
    e.printStackTrace();

        }

    }
}


import java.io.*;
import java.math.*;
public class compare{
    public static void main (String[] args){
try {
    BufferedReader inp = new BufferedReader(new InputStreamReader(System.in));
    String s1 = inp.readLine().replaceFirst("^0+(?!$)", "");
    String s2 = inp.readLine().replaceFirst("^0+(?!$)", "");

    if(s1.length() == s2.length()){
        if(s1.compareTo(s2) == 1){
            System.out.println(">");
        }
        else if(s1.compareTo(s2) == 0){
            System.out.println("=");
        }
        else
            System.out.println("<");

    }
    else{
        if(s1.length() < s2.length()){
            System.out.println("<");
        }
        else{
            System.out.println(">");

        }

    }

}
catch(IOException e){
    e.printStackTrace();

        }

    }
}


import java.io.*;
import java.math.*;
public class compare{
    public static void main (String[] args){
try {
    BufferedReader inp = new BufferedReader(new InputStreamReader(System.in));
    String s1 = inp.readLine().replaceFirst("^0+(?!$)", "");
    String s2 = inp.readLine().replaceFirst("^0+(?!$)", "");

    if(s1.length() == s2.length()){
        if(s1.compareTo(s2) == 1){
            System.out.println("<");
        }
        else if(s1.compareTo(s2) == 0){
            System.out.println("=");
        }
        else
            System.out.println(">");

    }
    else{
        if(s1.length() < s2.length()){
            System.out.println("<");
        }
        else{
            System.out.println(">");

        }

    }

}
catch(IOException e){
    e.printStackTrace();

        }

    }
}


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;

public class TwoLongInteger {

	public static String trimZero(String number) {
		StringBuffer strBuf = new StringBuffer();
		strBuf.append(number);
		int i = 0;
		while(strBuf.length() > 1) {
			if(strBuf.charAt(i) == '0') {
				strBuf.deleteCharAt(i);
			} else {
				break;
			}
		}

		return strBuf.toString();
	}

	public static void main(String[] args) {
		// TODO Auto-generated method stub

		BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter writer = new PrintWriter(System.out);

		try {

			String first = trimZero(reader.readLine());
			String second = trimZero(reader.readLine());

			int result = 0;
			if(first.length() == second.length()) {
				result = first.compareTo(second);
				if(result < 0) {
					writer.println("<");
				} else if (result == 0) {
					writer.println("=");
				} else if(result > 0) {
					writer.println(">");
				}

			} else if(first.length() > second.length()) {
				writer.println(">");

			} else if(first.length() < second.length()) {
				writer.println("<");
			}

			reader.close();
			writer.close();

		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}

	}

}


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.text.CharacterIterator;
import java.text.StringCharacterIterator;

public class TwoLongInteger {

	public static String trimZero(String number) {
//		StringBuffer strBuf = new StringBuffer();
//		strBuf.append(number);
		String regex = "^0+(?!$)";
		number = number.replaceFirst(regex, "");

//		int i = 0;
//		while(strBuf.length() > 1) {
//			if(strBuf.charAt(i) == '0') {
//				strBuf.deleteCharAt(i);
//			} else {
//				break;
//			}
//		}

		return number;

	}

	public static void main(String[] args) {
		// TODO Auto-generated method stub

		BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter writer = new PrintWriter(System.out);

		try {

			String first = trimZero(reader.readLine());
			String second = trimZero(reader.readLine());

			int result = 0;
			if(first.length() == second.length()) {
				result = first.compareTo(second);
				if(result < 0) {
					writer.println("<");
				} else if (result == 0) {
					writer.println("=");
				} else if(result > 0) {
					writer.println(">");
				}

			} else if(first.length() > second.length()) {
				writer.println(">");

			} else if(first.length() < second.length()) {
				writer.println("<");
			}

			reader.close();
			writer.close();

		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}

	}

}


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class TwoLongInteger {

	public static String trimZero(String number) {
		StringBuffer strBuf = new StringBuffer();
		strBuf.append(number);
		int i = 0;
		while(strBuf.length() > 1) {
			if(strBuf.charAt(i) == '0') {
				strBuf.deleteCharAt(i);
			} else {
				break;
			}
		}

		return strBuf.toString();
	}

	public static void main(String[] args) {
		// TODO Auto-generated method stub

		BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));

		try {

			String first = trimZero(reader.readLine());
			String second = trimZero(reader.readLine());

			int result = first.compareTo(second);
			if(result < 0) {
				System.out.println("<");
			} else if (result == 0) {
				System.out.println("=");
			} else if(result > 0) {
				System.out.println(">");
			}

			reader.close();

		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}

	}

}


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class TwoLongInteger {

	public static void main(String[] args) {
		// TODO Auto-generated method stub

		BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));

		try {

			int first = Integer.parseInt(reader.readLine());
			int second = Integer.parseInt(reader.readLine());

			if(first == second) {
				System.out.println("=");
			} else if(first > second) {
				System.out.println(">");
			} else if(first < second) {
				System.out.println("<");
			}

			reader.close();

		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}

	}

}


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.text.CharacterIterator;
import java.text.StringCharacterIterator;

public class TwoLongInteger {

	public static String trimZero(String number) {
		StringBuffer strBuf = new StringBuffer();
		strBuf.append(number);
		int i = 0;

		CharacterIterator sci = new StringCharacterIterator(number);
		for(char ch = sci.first(); ch != CharacterIterator.DONE; ch = sci.next() ) {
			if(ch != '0') {
				i = sci.getIndex();
				break;
			}
		}

		return strBuf.substring(i).toString();

//		int i = 0;
//		while(strBuf.length() > 1) {
//			if(strBuf.charAt(i) == '0') {
//				strBuf.deleteCharAt(i);
//			} else {
//				break;
//			}
//		}

//		return strBuf.toString();

	}

	public static void main(String[] args) {
		// TODO Auto-generated method stub

		BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter writer = new PrintWriter(System.out);

		try {

			String first = trimZero(reader.readLine());
			String second = trimZero(reader.readLine());

			int result = 0;
			if(first.length() == second.length()) {
				result = first.compareTo(second);
				if(result < 0) {
					writer.println("<");
				} else if (result == 0) {
					writer.println("=");
				} else if(result > 0) {
					writer.println(">");
				}

			} else if(first.length() > second.length()) {
				writer.println(">");

			} else if(first.length() < second.length()) {
				writer.println("<");
			}

			reader.close();
			writer.close();

		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}

	}

}


#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <utility>
#include <string.h>
using namespace std;

struct Point
{
	int  x, y, idx, type;
	bool operator<(const Point& t) const {
		return x < t.x || x==t.x && y<t.y;
	}
};

const int NN = 100000 + 128;

Point  src[NN], A[NN<<2], B[NN<<2], LA[NN<<2], RA[NN<<2];
int  N, An, LAn, RAn;

double  min_len;
int  cur_ans[4];
int  inv[5] = {0, 4, 3, 2, 1};

bool cmp(const Point& a, const Point& b) {
	return a.y < b.y || a.y==b.y && a.x < b.x;
}

inline void update_ans(const double& len, const Point& a, const Point& b) {
	if(len < min_len) {
		min_len = len;
		cur_ans[0] = a.idx;  cur_ans[1] = a.type;
		cur_ans[2] = b.idx;  cur_ans[3] = inv[b.type];
	}
}
inline double dist(const Point& a, const Point& b) {
	return sqrt(double(b.x-a.x)*(b.x-a.x) + double(b.y-a.y)*(b.y-a.y));
}

void  calc(int L, int R) {
	int  M = (L + R) >> 1;
	if(R < L+80) {
		for(int i=L; i<=R; ++i) for(int j=i+1; j<=R; ++j) if(A[i].idx != A[j].idx)
			update_ans(dist(A[i], A[j]), A[i], A[j]);
		sort(A+L, A+R+1, cmp);
		return;
	}
	calc(L, M);
	calc(M+1, R);
	double  X = A[M].x;
	LAn = RAn = 0;
	for(int i=L; i<=M; ++i) if(A[i].x+min_len > X) LA[LAn++] = A[i];
	for(int i=M+1; i<=R; ++i) if(X+min_len > A[i].x) RA[RAn++] = A[i];

	int  Ri = 0;
	for(int i=0; i<LAn; ++i) {
		while(Ri<RAn && RA[Ri].y+min_len < LA[i].y) ++Ri;
		for(int j=Ri; j<RAn && RA[j].y-LA[i].y < min_len; ++j) if(LA[i].idx != RA[j].idx)
			update_ans(dist(LA[i], RA[j]), LA[i], RA[j]);
	}

	for(int  i=L, j=M+1, k=L; k<=R; ) {
		if(i>M || j<=R && A[i].y < A[j].y) B[k++] = A[i++];
		else  B[k++] = A[j++];
	}
	for(int i=L; i<=R; ++i) A[i]=B[i];
}

int main(int argc, char *argv[])
{
	  freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
	scanf("%d", &N);
	An = 0;
	for(int i=0; i<N; ++i) {
		scanf("%d%d", &src[i].x, &src[i].y);
		src[i].idx = i+1;
		src[i].type = 1;
		Point  t = src[i];
		A[An++] = t;
		t.x *= -1;  t.type = 2;
		A[An++] = t;
		t.x *= -1; t.y *= -1; t.type = 3;
		A[An++] = t;
		t.x *= -1; t.type = 4;
		A[An++] = t;
	}
	min_len = 1e30;
	if(An <= 5120) {
		for(int i=0; i<An; ++i) for(int j=i+1; j<An; ++j) if(A[i].idx != A[j].idx)
			update_ans(dist(A[i], A[j]), A[i], A[j]);
	}
	else {
		sort(A, A+An);
		calc(0, An-1);
	}
	printf("%d %d %d %d\n", cur_ans[0], cur_ans[1], cur_ans[2], cur_ans[3]);
	return 0;
}


#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <utility>
#include <string.h>
using namespace std;

struct Point
{
	int  x, y, idx, type;
	bool operator<(const Point& t) const {
		return x < t.x || x==t.x && y<t.y;
	}
};

const int NN = 100000 + 128;

Point  src[NN], A[NN<<2], B[NN<<2], LA[NN<<2], RA[NN<<2];
int  N, An, LAn, RAn;

double  min_len;
int  cur_ans[4];
int  inv[5] = {0, 4, 3, 2, 1};

bool cmp(const Point& a, const Point& b) {
	return a.y < b.y || a.y==b.y && a.x < b.x;
}

inline void update_ans(const double& len, const Point& a, const Point& b) {
	if(len < min_len) {
		min_len = len;
		cur_ans[0] = a.idx;  cur_ans[1] = a.type;
		cur_ans[2] = b.idx;  cur_ans[3] = inv[b.type];
	}
}
inline double dist(const Point& a, const Point& b) {
	return sqrt(double(b.x-a.x)*(b.x-a.x) + double(b.y-a.y)*(b.y-a.y));
}

void  calc(int L, int R) {
	int  M = (L + R) >> 1;
	if(R < L+80) {
		for(int i=L; i<=R; ++i) for(int j=i+1; j<=R; ++j) if(A[i].idx != A[j].idx)
			update_ans(dist(A[i], A[j]), A[i], A[j]);
		sort(A+L, A+R+1, cmp);
		return;
	}
	calc(L, M);
	calc(M+1, R);
	int  X = A[M].x;
	int  int_len = (int)(min_len + 1.00999);
	LAn = RAn = 0;
	for(int i=L; i<=M; ++i) if(A[i].x+int_len >= X) LA[LAn++] = A[i];
	for(int i=M+1; i<=R; ++i) if(X+int_len >= A[i].x) RA[RAn++] = A[i];

	int  Ri = 0;
	for(int i=0; i<LAn; ++i) {
		while(Ri<RAn && RA[Ri].y+int_len < LA[i].y) ++Ri;
		for(int j=Ri; j<RAn && RA[j].y-LA[i].y < int_len; ++j) if(LA[i].idx != RA[j].idx)
			update_ans(dist(LA[i], RA[j]), LA[i], RA[j]);
	}

	for(int  i=L, j=M+1, k=L; k<=R; ) {
		if(i>M || j<=R && A[i].y < A[j].y) B[k++] = A[i++];
		else  B[k++] = A[j++];
	}
	for(int i=L; i<=R; ++i) A[i]=B[i];
}

int main(int argc, char *argv[])
{
	  freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
	scanf("%d", &N);
	An = 0;
	for(int i=0; i<N; ++i) {
		scanf("%d%d", &src[i].x, &src[i].y);
		src[i].idx = i+1;
		src[i].type = 1;
		Point  t = src[i];
		A[An++] = t;
		t.x *= -1;  t.type = 2;
		A[An++] = t;
		t.x *= -1; t.y *= -1; t.type = 3;
		A[An++] = t;
		t.x *= -1; t.type = 4;
		A[An++] = t;
	}
	min_len = 1e30;
	if(An <= 5120) {
		for(int i=0; i<An; ++i) for(int j=i+1; j<An; ++j) if(A[i].idx != A[j].idx)
			update_ans(dist(A[i], A[j]), A[i], A[j]);
	}
	else {
		sort(A, A+An);
		calc(0, An-1);
	}
	printf("%d %d %d %d\n", cur_ans[0], cur_ans[1], cur_ans[2], cur_ans[3]);
	return 0;
}


#include <iostream>
#include <fstream>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <sstream>
#include <string>
#include <vector>
using namespace std;

#define EPS 1e-9
#define INF MOD
#define MOD 1000000007LL
#define fir first
#define iss istringstream
#define sst stringstream
#define ite iterator
#define ll long long
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<n;i++)
#define pi pair<int,int>
#define pb push_back
#define sec second
#define sh(i) (1LL<<i)
#define sz size()
#define vi vector<int>
#define vc vector
#define vl vector<ll>
#define vs vector<string>

int n,x,y,t,m=INF,a1,a2;
struct P{int x,y,t,o;};
P p[100010];

bool comp(P a,P b){
    return a.x*a.x+a.y*a.y<b.x*b.x+b.y*b.y;
}

int main(){
    freopen("input.txt","r",stdin),freopen("output.txt","w",stdout);
    cin>>n;
    rep(i,n){
        cin>>x>>y;
        if(x<0&&y<0){
            p[i].x=-x,p[i].y=-y,p[i].t=4;
        }else if(x<0){
            p[i].x=-x,p[i].y=y,p[i].t=2;
        }else if(y<0){
            p[i].x=x,p[i].y=-y,p[i].t=3;
        }else{
            p[i].x=x,p[i].y=y,p[i].t=1;
        }
        p[i].o=i+1;
    }
    sort(p,p+n,comp);
    rep(i,n)rep2(j,i+1,min(i+1001,n)){
        int d=(p[i].x-p[j].x)*(p[i].x-p[j].x)+(p[i].y-p[j].y)*(p[i].y-p[j].y);
        if(d<m){
            a1=i,a2=j,m=d;
        }
    }
    cout<<p[a1].o<<" "<<p[a1].t<<" "<<p[a2].o<<" "<<5-p[a2].t;
}


#include <iostream>
#include <fstream>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <sstream>
#include <string>
#include <vector>
using namespace std;

#define EPS 1e-9
#define INF MOD
#define MOD 1000000007LL
#define fir first
#define iss istringstream
#define sst stringstream
#define ite iterator
#define ll long long
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<n;i++)
#define pi pair<int,int>
#define pb push_back
#define sec second
#define sh(i) (1LL<<i)
#define sz size()
#define vi vector<int>
#define vc vector
#define vl vector<ll>
#define vs vector<string>

int n,x,y,t,m=INF,a1,a2;
struct P{int x,y,t,o;};
P p[100010];

bool comp(P a,P b){
    return a.x*a.x+a.y*a.y<b.x*b.x+b.y*b.y;
}

int main(){
    freopen("input,txt","r",stdin),freopen("output.txt","w",stdout);
    cin>>n;
    rep(i,n){
        cin>>x>>y;
        if(x<0&&y<0){
            p[i].x=-x,p[i].y=-y,p[i].t=4;
        }else if(x<0){
            p[i].x=-x,p[i].y=y,p[i].t=2;
        }else if(y<0){
            p[i].x=x,p[i].y=-y,p[i].t=3;
        }else{
            p[i].x=x,p[i].y=y,p[i].t=1;
        }
        p[i].o=i+1;
    }
    sort(p,p+n,comp);
    rep(i,n)cout<<p[i].x<<" "<<p[i].y<<endl;
    rep(i,n)rep2(j,i+1,min(i+1001,n)){
        int d=(p[i].x-p[j].x)*(p[i].x-p[j].x)+(p[i].y-p[j].y)*(p[i].y-p[j].y);
        if(d<m){
            a1=i,a2=j,m=d;
        }
    }
    cout<<m<<" "<<a1<<" "<<a2<<endl;
    cout<<p[a1].o<<" "<<p[a1].t<<" "<<p[a2].o<<" "<<5-p[a2].t;
}


#include <iostream>
#include <fstream>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <sstream>
#include <string>
#include <vector>
using namespace std;

#define EPS 1e-9
#define INF MOD
#define MOD 1000000007LL
#define fir first
#define iss istringstream
#define sst stringstream
#define ite iterator
#define ll long long
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<n;i++)
#define pi pair<int,int>
#define pb push_back
#define sec second
#define sh(i) (1LL<<i)
#define sz size()
#define vi vector<int>
#define vc vector
#define vl vector<ll>
#define vs vector<string>

int n,x,y,t,m=INF,a1,a2;
struct P{int x,y,t,o;};
P p[100010];

bool comp(P a,P b){
    ll x=a.x-INF,y=a.y-INF,xx=b.x-INF,yy=b.y-INF;
    return x*x+y*y<xx*xx+yy*yy;
}

int main(){
    freopen("input.txt","r",stdin),freopen("output.txt","w",stdout);
    cin>>n;
    rep(i,n){
        cin>>x>>y;
        if(x<0&&y<0){
            p[i].x=-x,p[i].y=-y,p[i].t=4;
        }else if(x<0){
            p[i].x=-x,p[i].y=y,p[i].t=2;
        }else if(y<0){
            p[i].x=x,p[i].y=-y,p[i].t=3;
        }else{
            p[i].x=x,p[i].y=y,p[i].t=1;
        }
        p[i].o=i+1;
    }
    sort(p,p+n,comp);
    rep(i,n)rep2(j,i+1,min(i+201,n)){
        int d=(p[i].x-p[j].x)*(p[i].x-p[j].x)+(p[i].y-p[j].y)*(p[i].y-p[j].y);
        if(d<m){
            a1=i,a2=j,m=d;
        }
    }
    cout<<p[a1].o<<" "<<p[a1].t<<" "<<p[a2].o<<" "<<5-p[a2].t;
}


#include <iostream>
#include <fstream>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <sstream>
#include <string>
#include <vector>
using namespace std;

#define EPS 1e-9
#define INF MOD
#define MOD 1000000007LL
#define fir first
#define iss istringstream
#define sst stringstream
#define ite iterator
#define ll long long
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<n;i++)
#define pi pair<int,int>
#define pb push_back
#define sec second
#define sh(i) (1LL<<i)
#define sz size()
#define vi vector<int>
#define vc vector
#define vl vector<ll>
#define vs vector<string>

int n,x,y,t,m=INF,a1,a2;
struct P{int x,y,t,o;};
P p[100010];

bool comp(P a,P b){
	return a.x*a.x+a.y*a.y<b.x*b.x+b.y*b.y;
}

int main(){
	freopen("input,txt","r",stdin),freopen("output.txt","w",stdout);
	cin>>n;
	rep(i,n){
		cin>>x>>y;
		if(x<0&&y<0){
			p[i].x=-x,p[i].y=-y,p[i].t=4;
		}else if(x<0){
			p[i].x=-x,p[i].y=y,p[i].t=2;
		}else if(y<0){
			p[i].x=x,p[i].y=-y,p[i].t=3;
		}else{
			p[i].x=x,p[i].y=y,p[i].t=1;
		}
		p[i].o=i+1;
	}
	sort(p,p+n,comp);
	rep(i,n)rep2(j,i+1,min(i+1001,n)){
		int d=(p[i].x-p[j].x)*(p[i].x-p[j].x)+(p[i].y-p[j].y)*(p[i].y-p[j].y);
		if(d<m){
			a1=i,a2=j,m=d;
		}
	}
	cout<<p[a1].o<<" "<<p[a1].t<<" "<<p[a2].o<<" "<<5-p[a2].t;
}


#include <iostream>
#include <fstream>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <sstream>
#include <string>
#include <vector>
using namespace std;

#define EPS 1e-9
#define INF MOD
#define MOD 1000000007LL
#define fir first
#define iss istringstream
#define sst stringstream
#define ite iterator
#define ll long long
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<n;i++)
#define pi pair<int,int>
#define pb push_back
#define sec second
#define sh(i) (1LL<<i)
#define sz size()
#define vi vector<int>
#define vc vector
#define vl vector<ll>
#define vs vector<string>

int n,x,y,t,m=INF,a1,a2;
struct P{int x,y,t,o;};
P p[100010];

bool comp(P a,P b){
    return a.x*a.x+a.y*a.y<b.x*b.x+b.y*b.y;
}

int main(){
    freopen("input,txt","r",stdin),freopen("output.txt","w",stdout);
    cin>>n;
    rep(i,n){
        cin>>x>>y;
        if(x<0&&y<0){
            p[i].x=-x,p[i].y=-y,p[i].t=4;
        }else if(x<0){
            p[i].x=-x,p[i].y=y,p[i].t=2;
        }else if(y<0){
            p[i].x=x,p[i].y=-y,p[i].t=3;
        }else{
            p[i].x=x,p[i].y=y,p[i].t=1;
        }
        p[i].o=i+1;
    }
    sort(p,p+n,comp);
    rep(i,n)rep2(j,i+1,min(i+1001,n)){
        int d=(p[i].x-p[j].x)*(p[i].x-p[j].x)+(p[i].y-p[j].y)*(p[i].y-p[j].y);
        if(d<m){
            a1=i,a2=j,m=d;
        }
    }
    cout<<p[a1].o<<" "<<p[a1].t<<" "<<p[a2].o<<" "<<5-p[a2].t;
}


#include <iostream>
#include <fstream>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <sstream>
#include <string>
#include <vector>
using namespace std;

#define EPS 1e-9
#define INF MOD
#define MOD 1000000007LL
#define fir first
#define iss istringstream
#define sst stringstream
#define ite iterator
#define ll long long
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<n;i++)
#define pi pair<int,int>
#define pb push_back
#define sec second
#define sh(i) (1LL<<i)
#define sz size()
#define vi vector<int>
#define vc vector
#define vl vector<ll>
#define vs vector<string>

int n,x,y,t,m=INF,a1,a2;
struct P{int x,y,t,o;};
P p[100010];

bool comp(P a,P b){
    return a.x*a.x+a.y*a.y<b.x*b.x+b.y*b.y;
}

int main(){
    freopen("input,txt","r",stdin),freopen("output.txt","w",stdout);
    cin>>n;
    rep(i,n){
        cin>>x>>y;
        if(x<0&&y<0){
            p[i].x=-x,p[i].y=-y,p[i].t=4;
        }else if(x<0){
            p[i].x=-x,p[i].y=y,p[i].t=2;
        }else if(y<0){
            p[i].x=x,p[i].y=-y,p[i].t=3;
        }else{
            p[i].x=x,p[i].y=y,p[i].t=1;
        }
        p[i].o=i+1;
    }
    sort(p,p+n,comp);
    rep(i,n)cout<<p[i].x<<" "<<p[i].y<<endl;
    rep(i,n)rep2(j,i+1,min(i+1001,n)){
        int d=(p[i].x-p[j].x)*(p[i].x-p[j].x)+(p[i].y-p[j].y)*(p[i].y-p[j].y);
        if(d<m){
            a1=i,a2=j,m=d;
        }
    }
    cout<<d<<" "<<a1<<" "<<a2<<endl;
    cout<<p[a1].o<<" "<<p[a1].t<<" "<<p[a2].o<<" "<<5-p[a2].t;
}