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:
n=int(input(''))
z={}
ch={}
tf={}
for i in range(0,n):
    z[i],ch[i],tf[i]=map(str,input('').split())
    ch[i]=int(ch[i])
    if z[i]=='<': z[i]=int(1)
    if z[i]=='<=': z[i]=int(2)
    if z[i]=='>': z[i]=int(3)
    if z[i]=='>=': z[i]=int(4)
    if tf[i]=='N':
        if z[i]==1:
            z[i]=4
        else:
            if z[i]==2: z[i]=3
            else:
                if z[i]==3: z[i]=2
                else:
                    if z[i]==4: z[i]=1
    if z[i]==1:
        tf[i]=ch[i]-1
    if z[i]==3:
        tf[i]=ch[i]+1
    if ((z[i]==2)or(z[i]==4)): tf[i]=ch[i]
    
def proverka(x,znak,oo):
    if znak==1:
        if x<oo: return 1
        else: return 0
    elif znak==2:
        if x<=oo: return 1
        else: return 0       
    elif znak==3:
        if x>oo: return 1
        else: return 0
    elif znak==4:
        if x>=oo: return 1
        else: return 0

for i in range(0,n):
    l=1
    for j in range(0,n):
        l*=proverka(tf[i],z[j],ch[j])
        if (l==0): break
    if l==1:
        print(tf[i])
        exit(0)
print("Impossible")