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 int INF = 1e18;
const long long int N = 1e5 + 5;
long long int mod = 998244353;
void null() {
  long long int n;
  cin >> n;
  long long int lo = -2e9, hi = 2e9;
  while (n--) {
    string x;
    long long int y;
    char z;
    cin >> x >> y >> z;
    if ((long long int)x.size() == 2) {
      if (x[0] == '>') {
        if (z == 'Y') {
          lo = max(lo, y);
        } else {
          hi = min(hi, y - 1);
        }
      } else {
        if (z == 'Y') {
          hi = min(hi, y);
        } else {
          lo = max(lo, y + 1);
        }
      }
    } else {
      if (x[0] == '>') {
        if (z == 'Y') {
          lo = max(lo, y + 1);
        } else {
          hi = min(hi, y);
        }
      } else {
        if (z == 'Y') {
          hi = min(hi, y - 1);
        } else {
          lo = max(lo, y);
        }
      }
    }
  }
  if (lo > hi)
    cout << "Impossible";
  else
    cout << lo;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(0);
  cout << setprecision(4);
  cout << fixed;
  long long int t = 1;
  clock_t start, end;
  start = clock();
  while (t--) {
    null();
  }
  end = clock();
  double time_taken = double(end - start) / double(CLOCKS_PER_SEC);
}