#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 2;
pair<int, int> p[102], res[102];
int can[7][7], du[7], sz;
void dfs(int x) {
  for (int i = 0; i < 7; ++i)
    if (can[x][i]) {
      --can[x][i];
      --can[i][x];
      dfs(i);
      res[sz++] = make_pair(i, x);
    }
}
int main() {
  ios::sync_with_stdio(false);
  int n, first;
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    int x, y;
    cin >> x >> y;
    ++du[x], ++du[y];
    ++can[x][y], ++can[y][x];
    p[i] = make_pair(x, y);
  }
  int cnt = 0;
  for (int i = 0; i < 7; ++i)
    if (du[i]) first = i;
  for (int i = 0; i < 7; ++i)
    if (du[i] & 1) ++cnt, first = i;
  if (cnt > 2)
    puts("No solution");
  else {
    dfs(first);
    if (sz < n)
      puts("No solution");
    else {
      for (int i = 0; i < n; ++i)
        for (int k = 1; k <= n; ++k)
          if (p[k].first == res[i].first && p[k].second == res[i].second) {
            printf("%d +\n", k);
            p[k] = make_pair(-1, -1);
            break;
          } else if (p[k].first == res[i].second &&
                     p[k].second == res[i].first) {
            printf("%d -\n", k);
            p[k] = make_pair(-1, -1);
            break;
          }
    }
  }
  return 0;
}
