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:
// package Testing;
/* package codechef; // don't place package name! */

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;
import java.util.StringTokenizer;

/* Name of the class has to be "Main" only if the class is public. */

public class Codechef
{
    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader()
        {
            br = new BufferedReader(
                    new InputStreamReader(System.in));
        }

        String next()
        {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                }
                catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() { return Integer.parseInt(next()); }

        long nextLong() { return Long.parseLong(next()); }

        double nextDouble()
        {
            return Double.parseDouble(next());
        }

        String nextLine()
        {
            String str = "";
            try {
                str = br.readLine();
            }
            catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
    static int count = 0;
    public static void  backtrack(String temp, String str,int k, int strLen, int ind,int mid){
//        if(temp.charAt())
        if(ind > mid){
            String sub = str.substring(0,mid+1);
            if(sub.compareTo(temp) >= 0){
//                System.out.println(temp);
                count++;
            }
            return;
        }

//       int choices = str.charAt(ind) - 'a' + 1;
//       if(k < choices){
//           choices = k;
//       }
       for(int i = 0; i < k; i++){
           char j = 0;
            char c = 'a';
           while(j < i){
                j++;
                c++;
           }
//           String temp1 = temp;

          backtrack(temp+c,str,k,strLen,ind+1,mid);

       }
       return;

    }
//    public static  int[] ar = {10,11,12,22,23,33,43,44,45};
    public static boolean isInt(int ind,int[] arr){
        int n = arr.length;
        int a1,b1;
        if(arr[ind] < arr[ind+1]){
            a1 = arr[ind];
            b1 = arr[ind+1];
        }else{
            a1 = arr[ind+1];
            b1 = arr[ind];
        }
        int a2,b2;
        boolean res = false;
        for(int i = 0; i < n-1; i++){
            if(i == ind){
                continue;
            }
            if(arr[i] < arr[i+1]){
               a2 = arr[i];
               b2 = arr[i+1];
            }else{
                a2 = arr[i+1];
                b2 = arr[i];
            }
            if((a1<a2 && a2 < b1 && b1 < b2)||(a2 < a1 && a1 < b2 && b2 < b1)){
                res = true;
                break;
            }
        }
        return res;
    }
    public static void main (String[] args) throws java.lang.Exception
    {
        FastReader s = new FastReader();
        int n = s.nextInt();
        String sign;
        String ans;
        int   num;
        int  low = -2000000000;
        int high = 2000000000;

        for(int i = 0; i < n; i++){
            sign = s.next();
            num = s.nextInt();
            ans = s.next();
            if(sign.equals(">=")){
                if(ans.equals("Y")){
                    if(low < num)
                    low = num;
                }else{
                    if(high >= num)
                    high = num-1;
                }

            }else if(sign.equals(">")){
                if(ans.equals("Y")){
                    if(low <= num)
                    low = num+1;
                }else{
                    if(high > num)
                    high = num;
                }

            }else if (sign.equals("<=")){
                if(ans.equals("Y")){
                    if(high > num)
                    high = num;
                }else{
                    if(low <= num){
                        low = num+1;
                    }

                }

            }else{
                if(ans.equals("Y")){
                    if(high >= num)
                    high = num - 1;
                }else{
                    if(low < num){
                        low = num;
                    }
                }

            }
        }
        if(low > high){
            System.out.println("Impossible");
        }else if(low == high){
            System.out.println(low);
        }else{
            System.out.println(low+1);
        }

    }

}