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;
const long long N = 1e6;
int d() {
  int ret;
  scanf("%d", &ret);
  return ret;
}
long long lld() {
  long long ret;
  scanf("%lld", &ret);
  return ret;
}
bool cmp(pair<int, int> s, pair<int, int> f) {
  if (f.first > s.first)
    return true;
  else if (f.first == f.second && f.second < s.second)
    return true;
  else
    return false;
}
char arr[4];
char arr1[4];
int main() {
  int n = d(), lo = -2e9, hi = 2e9;
  while (n--) {
    scanf("%s", arr);
    int x = d();
    scanf("%s", arr1);
    if (arr[0] == '>' && arr[1] == '=') {
      if (arr1[0] == 'Y') {
        lo = max(lo, x);
      } else {
        hi = min(hi, x - 1);
      }
    } else if (arr[0] == '>') {
      if (arr1[0] == 'Y') {
        lo = max(lo, x + 1);
      } else {
        hi = min(hi, x);
      }
    } else if (arr[0] == '<' && arr[1] == '=') {
      if (arr1[0] == 'Y') {
        hi = min(x, hi);
      } else {
        lo = max(lo, x + 1);
      }
    } else if (arr[0] == '<') {
      if (arr1[0] == 'Y') {
        hi = min(x - 1, hi);
      } else {
        lo = max(lo, x);
      }
    }
  }
  if (lo > hi) {
    printf("Impossible\n");
    return 0;
  }
  printf("%d\n", lo);
}