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 non-zero 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 leading-zeroes thing, heptadecimal numbers are hard to compare.

As a member of the FCEN-DC, 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 non-empty strings of at most 105 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:
<
=

Added by:Pablo Ariel Heiber
Date:2010-08-13
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: NODEJS OBJC PERL6 VB.NET
Resource:FCEyN UBA ICPC Selection 2007

hide comments
2013-07-07 14:42:40 Nishant Gupta
no need to take array of size above 10^5....
optimised my solution after a tle ....got AC ... my 151st on spoj
2013-06-06 09:34:50 Prikshit Kumar
Please provide some more test cases. I am getting wrong answer again and again.
2012-01-28 17:45:51 manish kapoor
submission code :6409597
can somebody tell me why i am getting segmentation fault continuously,pls help...thnx
2011-11-09 04:37:16 Seshadri R
<comment removed respecting Hendrik's comment on revealing the algorithm in this column>

Last edit: 2011-12-05 04:26:29
2011-10-24 11:09:41 hibernating
tle tle :( :( is there any way other than calculating the decimal value and comparing....plz help

Last edit: 2011-10-24 11:12:18
2011-08-14 13:50:30 manish kapoor
5510587
i am getting run time error,but my code works fine.sm body pls suggest sm test cases...
2011-05-01 14:25:21 Piotr KÄ…kol
@KK - I don't agree. :-) I used 10^5 char array (*2) and got AC. :-)
2011-04-06 20:21:16 Kunal Kapadia
Test cases contains even strings of length > 10^5 as char array of length 10^5 gives segmentation fault whereas that of 10^6 got acc :)
2011-01-01 12:30:39 Gurpreet Singh
any hints plzz....
i am getting WA .....

RE: finally got AC...... a silly mistake.:P

Last edit: 2011-01-03 19:51:43
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.