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;
int n;
int in[4];
string s[10001];
int temp;
int chengF(int x, int y) {
  int i;
  for (i = 1; i <= y; i++) {
    x *= 10;
  }
  return x;
}
int main() {
  in[0] = -2000000000;
  in[1] = in[0];
  in[2] = 2000000000;
  in[3] = in[2];
  int i, j, k;
  cin >> n;
  for (i = 0; i < n; i++) {
    temp = 0;
    if (i == 0) cin.ignore(1024, '\n');
    getline(cin, s[i]);
    if (s[i][s[i].length() - 1] == 'N') {
      if (s[i][0] == '>' && s[i][1] != '=') {
        s[i][0] = '<';
        s[i][1] = '=';
      } else if (s[i][0] == '>' && s[i][1] == '=') {
        s[i][0] = '<';
        s[i][1] = ' ';
      } else if (s[i][0] == '<' && s[i][1] != '=') {
        s[i][0] = '>';
        s[i][1] = '=';
      } else if (s[i][0] == '<' && s[i][1] == '=') {
        s[i][0] = '>';
        s[i][1] = ' ';
      }
    }
    if (s[i][0] == '>' && s[i][1] != '=') {
      for (j = s[i].length() - 3, k = 0;
           ('0' <= (int)s[i][j] && (int)s[i][j] <= '9') || s[i][j] == '-';
           j--, k++) {
        if (s[i][j] == '-')
          temp = -temp;
        else
          temp += chengF((int)s[i][j] - '0', k);
      }
      if (temp > in[0]) {
        in[0] = temp;
      }
    } else if (s[i][0] == '>' && s[i][1] == '=') {
      for (j = s[i].length() - 3, k = 0;
           ('0' <= (int)s[i][j] && (int)s[i][j] <= '9') || s[i][j] == '-';
           j--, k++) {
        if (s[i][j] == '-')
          temp = -temp;
        else
          temp += chengF((int)s[i][j] - '0', k);
      }
      if (temp > in[1]) {
        in[1] = temp;
      }
    } else if (s[i][0] == '<' && s[i][1] != '=') {
      for (j = s[i].length() - 3, k = 0;
           ('0' <= (int)s[i][j] && (int)s[i][j] <= '9') || s[i][j] == '-';
           j--, k++) {
        if (s[i][j] == '-')
          temp = -temp;
        else
          temp += chengF((int)s[i][j] - '0', k);
      }
      if (temp < in[2]) {
        in[2] = temp;
      }
    } else if (s[i][0] == '<' && s[i][1] == '=') {
      for (j = s[i].length() - 3, k = 0;
           ('0' <= (int)s[i][j] && (int)s[i][j] <= '9') || s[i][j] == '-';
           j--, k++) {
        if (s[i][j] == '-')
          temp = -temp;
        else
          temp += chengF((int)s[i][j] - '0', k);
      }
      if (temp < in[3]) {
        in[3] = temp;
      }
    }
  }
  if (in[0] >= in[2] - 1 || in[0] >= in[3] || in[1] >= in[2] || in[1] > in[3]) {
    cout << "Impossible" << endl;
  } else {
    if (in[0] < in[1]) {
      if (in[2] > in[3]) {
        cout << in[1] << endl;
      } else {
        cout << in[1] << endl;
      }
    } else {
      if (in[2] > in[3]) {
        cout << in[3] << endl;
      } else {
        cout << in[2] - 1 << endl;
      }
    }
  }
  return 0;
}