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

Solution:
import java.io.*;
import java.util.*;
import java.lang.*;
import java.math.BigInteger;


public class Main {
  
    public static long[][] dp;

	public static void main(String[] args) throws Exception
	{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int t,ca,i,j;
		String[] my;
		String line = br.readLine();
        my = line.split(" ");
        int n,m,k;
        n = Integer.parseInt(my[0]);
        int lo = -2000000000;
        int hi = -lo;
        int mi = lo;
        int ma = hi;
        boolean valid = true;
        for(i=0;i<n;i++)
        {
            line = br.readLine();
            my = line.split(" ");
            int x= Integer.parseInt(my[1]);
            if(my[2].equals("Y")){
                
                if(my[0].equals("<"))
                {
                    if(hi >= x) hi = x-1;
                }
                else if(my[0].equals("<="))
                {
                    if(hi >= x)hi = x;
                }
                else if(my[0].equals(">"))
                {
                    if(lo <= x) lo = x+1;
                }
                else if(my[0].equals(">="))
                {
                    if(lo < x)lo = x;
                }
            }
            else {
                 if(my[0].equals("<"))
                {
                    if(lo < x)lo = x;
                   
                }
                else if(my[0].equals("<="))
                {
                    if(lo <= x) lo = x+1;
                   
                }
                else if(my[0].equals(">"))
                {
                    if(hi > x) hi = x;
                }
                else if(my[0].equals(">="))
                {
                    
                    if(hi >= x)hi = x-1;
                }
            }
        }
        if(hi < lo)valid = false;
        if (lo < mi)valid = false;
        if (hi > ma)valid = false;
        String ans = "Impossible";
        if(valid)ans = "" + lo;
        System.out.println(ans);
        }
    
}
class ut implements Comparator<Team>{
    public int compare(Team first, Team other)
    {
          if(first.pr > other.pr)return -1;
        if(first.pr < other.pr)return 1;
        if(first.ti < other.ti)return -1;
        if(first.ti > other.ti)return 1;
        if(first.in < other.in)return -1;
        if(first.in > other.in)return 1;
        return 0;
    }
}
class Team implements Comparable{
    int pr,ti,in;
    public Team(int a, int b, int c)
    {
        pr = a;
        ti = b;
        in = c;
    }
    public String toString()
    {
        return pr + " " + ti + " " + in+ "\n";
    }
    public int compareTo(Object obj)
    {
        Team other = (Team)obj;
        if(pr > other.pr)return -1;
        if(pr < other.pr)return 1;
        if(ti < other.ti)return -1;
        if(ti > other.ti)return 1;
        if(in < other.in)return -1;
        if(in > other.in)return 1;
        return 0;
    }
}