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;
vector<pair<long int, string> > v;
vector<pair<long int, string> >::iterator it;
int main() {
  long int i, j, k, l, n, m, T, f, p, ans, cnt, par, ele, r1, r2, mn, mx,
      ar[100005];
  char x;
  string s[100005], a, b, c, d, t;
  a = "<=";
  b = ">=";
  c = "<";
  d = ">";
  scanf("%ld", &n);
  mn = 1000000007;
  mx = -1000000007;
  for (i = 0; i < n; i++) {
    cin >> s[i];
    cin >> ar[i];
    cin >> x;
    if (s[i] == a && x == 'N')
      s[i] = d;
    else if (s[i] == b && x == 'N')
      s[i] = c;
    else if (s[i] == c && x == 'N')
      s[i] = b;
    else if (s[i] == d && x == 'N')
      s[i] = a;
    if (s[i] == a) mn = min(mn, ar[i]);
    if (s[i] == b) mx = max(mx, ar[i]);
    if (s[i] == c) mn = min(mn, ar[i] - 1);
    if (s[i] == d) mx = max(mx, ar[i] + 1);
  }
  if (mx <= mn)
    printf("%ld\n", mn);
  else
    printf("Impossible");
  return 0;
}