#include <bits/stdc++.h>
using namespace std;
vector<int> g[10], ans;
int a[10][10] = {0};
int used[10] = {0};
struct edge {
  int u, v, id;
  bool used;
  edge(){};
  edge(int u, int v, int id) : u(u), v(v), id(id) { used = false; };
};
void dfs(int v) {
  for (int i = 0; i < (int)g[v].size(); i++) {
    int to = g[v][i];
    if (a[v][to] > 0) {
      a[v][to]--;
      a[to][v]--;
      dfs(to);
    }
  }
  ans.push_back(v);
}
int main() {
  int n;
  cin >> n;
  vector<edge> edges;
  for (int i = 0; i < n; i++) {
    int u, v;
    cin >> u >> v;
    edges.push_back(edge(u, v, i + 1));
    a[u][v]++;
    a[v][u]++;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  int not_odd = 0;
  for (int i = 0; i <= 6; i++)
    if (g[i].size() % 2) not_odd++;
  if (not_odd != 0 && not_odd != 2) {
    cout << "No solution" << endl;
    return 0;
  }
  if (not_odd > 0) {
    for (int i = 0; i <= 6; i++)
      if (g[i].size() % 2) {
        dfs(i);
        break;
      }
  } else
    for (int i = 0; i <= 6; i++)
      if (g[i].size()) {
        dfs(i);
        break;
      }
  bool bad = false;
  for (int i = 0; i <= 6; i++)
    for (int j = 0; j <= 6; j++)
      if (a[i][j] > 0) bad = true;
  if (bad) {
    cout << "No solution" << endl;
    return 0;
  }
  for (int i = 0; i < (int)ans.size() - 1; i++) {
    int u = ans[i], v = ans[i + 1];
    for (int j = 0; j < n; j++)
      if (!edges[j].used && edges[j].u == u && edges[j].v == v) {
        cout << edges[j].id << " +" << endl;
        edges[j].used = true;
        break;
      } else if (!edges[j].used && edges[j].u == v && edges[j].v == u) {
        cout << edges[j].id << " -" << endl;
        edges[j].used = true;
        break;
      }
  }
  return 0;
}
