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>
const long long inf = 1000000000000000000;
using namespace std;
bool prime[1000005];
long long gcd(long long a, long long b) {
  if (a < b) gcd(b, a);
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
  long long x = (a / gcd(a, b)) * b;
  return x;
}
long long power(long long x, long long n, long long m = inf) {
  if (x == 0) {
    return 0;
  }
  if (n == 0) {
    return 1;
  }
  long long ans;
  if (n % 2 == 0) {
    long long smallAns = power(x, n / 2, m);
    ans = (smallAns * smallAns) % m;
  } else {
    long long smallAns = power(x, n - 1, m);
    ans = x;
    ans = (ans * smallAns) % m;
  }
  return (ans + m) % m;
}
void fillPrime() {
  long long i, j;
  long long n = 1000001;
  for (int i = 0; i < n; i += 1) {
    prime[i] = 1;
  }
  prime[0] = 0;
  prime[1] = 0;
  for (i = 2; i * i <= n; i++) {
    if (prime[i]) {
      for (j = i * i; j <= n; j += i) {
        prime[j] = 0;
      }
    }
  }
}
long long kadane(long long arr[], int n) {
  long long dp[n];
  dp[0] = arr[0];
  long long maxm = dp[0];
  for (int i = 1; i < n; i += 1) {
    if (dp[i - 1] > 0) {
      dp[i] = arr[i] + dp[i - 1];
    } else {
      dp[i] = arr[i];
    }
    maxm = max(maxm, dp[i]);
  }
  return maxm;
}
bool compare(pair<int, int> p1, pair<int, int> p2) {
  return p1.second < p2.second;
}
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t = 1;
  while (t--) {
    int n;
    cin >> n;
    string s;
    char ch;
    int val;
    int left = -2e9;
    int right = 2e9;
    bool flag = false;
    while (n--) {
      cin >> s >> val >> ch;
      if (s[0] == '<') {
        if (s.length() == 1) {
          if (ch == 'Y') {
            if (right > val - 1) right = val - 1;
          } else {
            if (left < val) left = val;
          }
        } else {
          if (ch == 'Y') {
            if (right > val) right = val;
          } else {
            if (left < val + 1) left = val + 1;
          }
        }
      } else {
        if (s.length() == 1) {
          if (ch == 'Y') {
            if (left < val + 1) left = val + 1;
          } else {
            if (right > val) right = val;
          }
        } else {
          if (ch == 'Y') {
            if (left < val) left = val;
          } else {
            if (right > val - 1) right = val - 1;
          }
        }
      }
      if (left > right) flag = true;
    }
    if (flag)
      cout << "Impossible" << '\n';
    else
      cout << right << '\n';
  }
  return 0;
}