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 PYTHON3):

Solution:
#import math
#n, m = input().split()
#n = int (n)
#m = int (m)
#n, m, k = input().split()
#n = int (n)
#m = int (m)
#k = int (k)
n = int(input())
#m = int(input())
#s = input()
##t = input()
#a = list(map(int, input().split()))
#print(l)
#c = list(map(int, input().split()))

#x1, y1, x2, y2 =map(int,input().split())
#n = int(input())
#f = []
#t = [0]*n
#f = [(int(s1[0]),s1[1]), (int(s2[0]),s2[1]), (int(s3[0]), s3[1])]

#h = [""] * n
#f1 = sorted(f, key = lambda tup: tup[0])
u = 10**9+1
l = -u
for i in range(n):
    s = input().split()
    if (s[0] =='>='):
        if(s[2] == 'Y'):
            l = max(l, int(s[1]))
        else:
            u = min(u, int(s[1])-1)
    if (s[0] =='>'):
        if(s[2] == 'Y'):
            l = max(l, int(s[1])+1)
        else:
            u = min(u, int(s[1]))
    if (s[0] =='<='):
        if(s[2] == 'N'):
            l = max(l, int(s[1])+1)
        else:
            u = min(u, int(s[1]))
    if (s[0] =='<'):
        if(s[2] == 'N'):
            l = max(l, int(s[1]))
        else:
            u = min(u, int(s[1])-1)

if (l > u):
    print("Impossible")
else:
    print(u)
#f1 = sorted(t, key = lambda tup: tup[0])