#include <bits/stdc++.h>
using namespace std;
bool adj[110][110];
short color[110];
bool ok = true;
int n, m;
void dfs(int node, int ccolor) {
  color[node] = ccolor;
  for (int i = 0; i < m; i++) {
    if (adj[node][i]) {
      if (color[i] == 0) {
        dfs(i, ccolor * (-1));
      } else if (color[i] == ccolor) {
        ok = false;
      }
    }
  }
}
int main() {
  cin >> n >> m;
  int ai[110], bi[110], a, b, i, j;
  for (i = 0; i < m; i++) {
    cin >> ai[i] >> bi[i];
    if (bi[i] < ai[i]) swap(ai[i], bi[i]);
  }
  int x1, x2, y1, y2;
  for (i = 0; i < m; i++) {
    for (j = i + 1; j < m; j++) {
      if (ai[i] > ai[j] && ai[i] < bi[j] && bi[i] > bi[j])
        adj[i][j] = adj[j][i] = 1;
      if (ai[j] > ai[i] && ai[j] < bi[i] && bi[j] > bi[i])
        adj[i][j] = adj[j][i] = 1;
    }
  }
  for (i = 0; i < m; i++) {
    if (color[i] == 0) dfs(i, 1);
  }
  if (ok) {
    for (i = 0; i < m; i++) {
      if (color[i] == 1)
        cout << 'i';
      else if (color[i] == -1)
        cout << 'o';
    }
  } else {
    cout << "Impossible" << endl;
  }
  return 0;
}
