HEPNUM  Heptadecimal Numbers
The Factory of Computer Enhaced Numbers (FCEN) has asked its Development Comitee (DC)
to come up with a way to handle numbers written in base 17.
As everybody knows, base 17 is very important for many scientific applications, as well as for
engineering and other practical uses. Numbers in base 17 can be tough, but are kind and soft
if treated appropiately.
Numbers in base 17 are written by using a set of 17 characters: digits 0 to 9 with their usual
values, and uppercase letters A to G that have values from 10 to 16, respectively.
Base 17, probably because its basement on a prime number, does not require numbers to start
with a nonzero digit, so each number has many representations. For instance, the decimal
number 117 can be written as 6F , but also as 06F or even 00000006F .
Because of this leadingzeroes thing, heptadecimal numbers are hard to compare. As a member
of the FCENDC, you were asked to write a program that helps in this difficult and challenging
task.
Input
The input contains several test cases. Each test case is described in a single line that contains
two nonempty strings of at most 10^{5} heptadecimal digits, separated by a single space. The last
line of the input contains two asterisks separated by a single space and should not be processed
as a test case.
Output
For each test case output a single line with the sign “<” if the first heptadecimal number is
smaller than the second one, the sign “>” if the first heptadecimal number is greater than the
second one, or the sign “=” if both heptadecimal numbers are equal.
Example
Input:
006F B3B
0000 0
* *
Output:
<
=
hide comments
sri:
20151111 22:40:16
Learnt something useful...Nice problem


dwij28:
20150825 20:21:39
People who are talking about python being too slow for this, its not python, its your naive approach. I got an AC using python in this question. 

SangKuan:
20150821 10:18:39
use 10^5 + n array enough 

:.Mohib.::
20150217 17:46:54
silly mistakes coast me some wa but finally AC:)...nice question... 

Prikshit Kumar:
20140405 17:04:01
This question has some problem with its input. When i used an array of size 10^5,it showed me segmentation error but changing the size to 10^6 gave me correct answer.


Shreyans:
20131230 07:25:03
@Pablo Ariel Heiber,


@DubeY@:
20130731 16:37:35
ohh..!! finally AC :)


pika_pika:
20130709 14:43:47
python gives TLE and the same logic in c++ gives 0.04s AC... is python that slow. Got 2 SIGSEGV just for array size 10^5 instead of 10^5+1.. 

Nishant Gupta:
20130707 14:43:58
test cases that may help


Nishant Gupta:
20130707 14:42:40
no need to take array of size above 10^5....

Added by:  Pablo Ariel Heiber 
Date:  20100813 
Time limit:  0.383s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS objc PERL 6 VB.net 
Resource:  FCEyN UBA ICPC Selection 2007 