Problem: A TV show called "Guess a number!" is gathering popularity. The whole Berland, the old and the young, are watching the show.

The rules are simple. The host thinks of an integer y and the participants guess it by asking questions to the host. There are four types of acceptable questions:

  * Is it true that y is strictly larger than number x? 
  * Is it true that y is strictly smaller than number x? 
  * Is it true that y is larger than or equal to number x? 
  * Is it true that y is smaller than or equal to number x? 



On each question the host answers truthfully, "yes" or "no".

Given the sequence of questions and answers, find any integer value of y that meets the criteria of all answers. If there isn't such value, print "Impossible".

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 10000) — the number of questions (and answers). Next n lines each contain one question and one answer to it. The format of each line is like that: "sign x answer", where the sign is:

  * ">" (for the first type queries), 
  * "<" (for the second type queries), 
  * ">=" (for the third type queries), 
  * "<=" (for the fourth type queries). 



All values of x are integer and meet the inequation  - 109 ≤ x ≤ 109. The answer is an English letter "Y" (for "yes") or "N" (for "no").

Consequtive elements in lines are separated by a single space.

Output

Print any of such integers y, that the answers to all the queries are correct. The printed number y must meet the inequation  - 2·109 ≤ y ≤ 2·109. If there are many answers, print any of them. If such value doesn't exist, print word "Impossible" (without the quotes).

Examples

Input

4
&gt;= 1 Y
&lt; 3 N
&lt;= -3 N
&gt; 55 N


Output

17


Input

2
&gt; 100 Y
&lt; -100 Y


Output

Impossible

Solution (in PYTHON):

Solution:
#inp = open("input.txt", "r")
#R=lambda:map(float, inp.readline().strip().split(' '))
R=lambda:map(int, raw_input().strip().split(' '))

min_val = -2000000000
max_val = 2000000000

n, = R()

def large_val(x):
	min_val = x + 1

def small_val(x):
	max_val = x - 1

cnt = 0
flag = 1
while cnt < n:
	cnt += 1

	
	#line = inp.readline().strip().split(' ')
	line = raw_input().split(' ')

	if flag == 0:
		continue

	p_min_val = -2000000000
	p_max_val = 2000000000

	if (line[0] == '>=' and line[2] == 'Y') or (line[0] == '<' and line[2] == 'N'):
		p_min_val = int(line[1])
	elif (line[0] == '>=' and line[2] == 'N') or (line[0] == '<' and line[2] == 'Y'):
		p_max_val = int(line[1]) - 1
	elif (line[0] == '<=' and line[2] == 'Y') or (line[0] == '>' and line[2] == 'N'):
		p_max_val = int(line[1])
	elif (line[0] == '<=' and line[2] == 'N') or (line[0] == '>' and line[2] == 'Y'):
		p_min_val = int(line[1]) + 1

	#print p_min_val, p_max_val, min_val, max_val, flag
	if p_min_val > max_val or p_max_val < min_val:
		flag = 0

	max_val = min(p_max_val, max_val)
	min_val = max(p_min_val, min_val)


if max_val >= min_val:
	print min_val
else:
	print 'Impossible'