#include <bits/stdc++.h>
using namespace std;
int a[10][10], d[10], x[105], y[105], ans[205], use[105];
int n, m, k;
void dfs(int x) {
  for (int i = 0; i < 7; i++)
    if (a[x][i]) {
      a[x][i]--;
      a[i][x]--;
      dfs(i);
    }
  ans[m++] = x;
}
int main() {
  int i, j;
  cin >> n;
  for (i = 0; i < n; i++) {
    cin >> x[i] >> y[i];
    a[x[i]][y[i]]++;
    a[y[i]][x[i]]++;
    d[x[i]]++;
    d[y[i]]++;
  }
  int s = x[0];
  for (i = 0; i < 7; i++)
    if (d[i] & 1) {
      k++;
      s = i;
    }
  dfs(s);
  if (m != n + 1 || k > 2)
    cout << "No solution" << endl;
  else {
    for (i = 0; i < n; i++)
      for (j = 0; j < n; j++)
        if (!use[j]) {
          if (x[j] == ans[i] && y[j] == ans[i + 1]) {
            cout << j + 1 << " +" << endl;
            use[j] = 1;
            break;
          } else if (y[j] == ans[i] && x[j] == ans[i + 1]) {
            cout << j + 1 << " -" << endl;
            use[j] = 1;
            break;
          }
        }
  }
  return 0;
}
