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:
/*
 * Code Author: Akshay Miterani
 * DA-IICT
 */
import java.io.*;
import java.util.*;

public class Contest {

	
	public static void main(String args[]){
		InputReader in = new InputReader(System.in);
		OutputStream outputStream = System.out;
		PrintWriter out = new PrintWriter(outputStream);
		//----------My Code Starts Here----------
		int n=in.nextInt();
		int l=(int)(-2000000000);
		int u=(int)(2000000000);
		int ll,uu;
		while(n-->0){
		String s=in.nextLine();
		if(s.charAt(0)=='<'){
			String t[]=s.split(" ");
			if(t[2].equals("Y")){
				if(t[0].length()==2){
					uu=Integer.parseInt(t[1]);
					u=Math.min(u,uu);
				}
				else if(t[0].length()==1){
					uu=Integer.parseInt(t[1])-1;
					u=Math.min(u,uu);
				}
			}
			else{
				if(t[0].length()==2){
					ll=Integer.parseInt(t[1])+1;
					l=Math.max(l,ll);
				}
				else if(t[0].length()==1){
					ll=Integer.parseInt(t[1]);
					l=Math.max(l,ll);
				}
			}
		}
		else{
			String t[]=s.split(" ");
			if(t[2].equals("Y")){
				if(t[0].length()==2){
					ll=Integer.parseInt(t[1]);
					l=Math.max(l,ll);
				}
				else if(t[0].length()==1){
					ll=Integer.parseInt(t[1])+1;
					l=Math.max(l,ll);
				}
			}
			else{
				if(t[0].length()==2){
					uu=Integer.parseInt(t[1])-1;
					u=Math.min(u,uu);
				}
				else if(t[0].length()==1){
					uu=Integer.parseInt(t[1]);
					u=Math.min(u,uu);
				}
			}
		}
		}
		if(l<=u)
			out.println(l);
		else
			out.println("Impossible");
		out.close();	
		//---------------The End------------------
	}
	static long count(LinkedList<Integer> a){
		long ans=Integer.MIN_VALUE,tmp=0;
		for(int i=0;i<a.size();i++){
			tmp+=a.get(i);
		}
		return tmp;
	}
	static class Pair implements Comparable<Pair>{
		int i;
		long u,v;
		Pair(int ii,int vv){
			i=ii;v=vv;
		}
		@Override
		public int compareTo(Pair o) {
			if(o.v>this.v)
				return 1;
			else
				return -1;
		}
	}
	static class InputReader {
	    public BufferedReader reader;
	    public StringTokenizer tokenizer;

	    public InputReader(InputStream inputstream) {
	      reader = new BufferedReader(new InputStreamReader(inputstream));
	      tokenizer = null;
	    }
	    
	    public String nextLine(){
	    	String fullLine=null;
	    	while (tokenizer == null || !tokenizer.hasMoreTokens()) {
	            try {
	              fullLine=reader.readLine();
	            } catch (IOException e) {
	              throw new RuntimeException(e);
	            }
	            return fullLine;
	          }
	          return fullLine;
	    }
		public String next() {
	      while (tokenizer == null || !tokenizer.hasMoreTokens()) {
	        try {
	          tokenizer = new StringTokenizer(reader.readLine());
	        } catch (IOException e) {
	          throw new RuntimeException(e);
	        }
	      }
	      return tokenizer.nextToken();
	    }
		public long nextLong() {
		      return Long.parseLong(next());
		    }
	    public int nextInt() {
	      return Integer.parseInt(next());
	    }
	  }
}