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 int MOD = 1e9 + 7;
const int n_ = 1e5 + 1000;
const long double PI = acos(-1.0);
long long gcd(long long a, long long b) { return (a ? gcd(b % a, a) : b); }
long long power(long long a, long long n) {
  long long p = 1;
  while (n > 0) {
    if (n % 2) {
      p = p * a;
    }
    n >>= 1;
    a *= a;
  }
  return p;
}
long long power(long long a, long long n, long long mod) {
  long long p = 1;
  while (n > 0) {
    if (n % 2) {
      p = p * a;
      p %= mod;
    }
    n >>= 1;
    a *= a;
    a %= mod;
  }
  return p % mod;
}
bool vowel(char ch) {
  if (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u')
    return true;
  else
    return false;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long C[1005][1005];
  C[0][0] = 1;
  for (long long i = 1; i <= 1004; i++) C[0][i] = 0;
  for (long long i = 1; i <= 1004; i++) C[i][0] = 1;
  for (long long i = 1; i <= 1004; i++)
    for (long long j = 1; j <= 1004; j++)
      C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % MOD;
  long long n, x;
  char ch;
  string str;
  long long ly = -1 * MOD, ln = -1 * MOD, ry = MOD, rn = MOD;
  cin >> n;
  long long flag = 1;
  for (long long q = 0; q < n; q++) {
    cin >> str >> x >> ch;
    if (str == ">=") {
      if (ch == 'Y') {
        ly = max(ly, x);
      } else {
        rn = min(rn, x - 1);
      }
    }
    if (str == ">") {
      if (ch == 'Y') {
        ly = max(ly, x + 1);
      } else {
        rn = min(rn, x);
      }
    }
    if (str == "<=") {
      if (ch == 'Y') {
        ry = min(ry, x);
      } else {
        ln = max(ln, x + 1);
      }
    }
    if (str == "<") {
      if (ch == 'Y') {
        ry = min(ry, x - 1);
      } else {
        ln = max(ln, x);
      }
    }
    if (max(ln, ly) > min(ry, rn)) flag = 0;
  }
  if (!flag)
    cout << "Impossible";
  else
    cout << max(ln, ly);
  return 0;
}