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

Solution:
#include <bits/stdc++.h>
using namespace std;
int main() {
  int t, l, a, b, c, d, num, i, flag, an, ans;
  char str[100];
  long long min_ = -1000000002, max_ = 1000000002;
  scanf("%d", &t);
  scanf("\n");
  while (t--) {
    a = b = c = d = num = 0, flag = 0, ans = an = 0;
    gets(str);
    l = strlen(str);
    if (str[0] == '>' && str[1] == ' ') {
      a = 1;
      if (str[2] == '-') {
        i = 3;
        flag = 1;
      } else
        i = 2;
    } else if (str[0] == '>') {
      c = 1;
      if (str[3] == '-') {
        i = 4;
        flag = 1;
      } else
        i = 3;
    } else if (str[0] == '<' && str[1] == ' ') {
      b = 1;
      if (str[2] == '-') {
        i = 3;
        flag = 1;
      } else
        i = 2;
    } else {
      d = 1;
      if (str[3] == '-') {
        i = 4;
        flag = 1;
      } else
        i = 3;
    }
    for (i; i < l; i++) {
      if (str[i] < '0' || str[i] > '9') {
        if (str[i] == 'Y') {
          an = 1;
          break;
        } else if (str[i] == 'N') {
          if (a) {
            a = 0;
            d = 1;
          } else if (b) {
            b = 0;
            c = 1;
          } else if (c) {
            c = 0;
            b = 1;
          } else if (d) {
            d = 0;
            a = 1;
          }
          break;
        }
      } else {
        num = num * 10 + (str[i] - '0');
      }
    }
    if (flag) num = -num;
    if (a) {
      if (min_ <= num) {
        min_ = num + 1;
      }
    } else if (b) {
      if (max_ >= num) {
        max_ = num - 1;
      }
    } else if (c) {
      if (min_ < num) {
        min_ = num;
      }
    } else {
      if (max_ > num) max_ = num;
    }
  }
  if (min_ > max_) {
    printf("Impossible\n");
  } else
    printf("%I64d\n", min_);
  return 0;
}