#include <bits/stdc++.h>
using namespace std;
vector<int> ans;
int g[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; };
};
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));
    g[u][v]++;
    g[v][u]++;
  }
  int deg[10] = {0};
  for (int i = 0; i <= 6; i++)
    for (int j = 0; j <= 6; j++) deg[i] += g[i][j];
  int first = 0;
  while (deg[first] == 0) first++;
  int v1 = -1, v2 = -1;
  bool bad = false;
  for (int i = 0; i <= 6; i++)
    if (deg[i] & 1)
      if (v1 == -1)
        v1 = i;
      else if (v2 == -1)
        v2 = i;
      else
        bad = true;
  if (bad) {
    cout << "No solution" << endl;
    return 0;
  }
  if (v1 != -1 && v2 != -1) {
    g[v1][v2]++;
    g[v2][v1]++;
  }
  stack<int> st;
  st.push(first);
  while (!st.empty()) {
    int v = st.top();
    int i;
    for (i = 0; i <= 6; i++)
      if (g[v][i] > 0) break;
    if (i >= 7) {
      ans.push_back(v);
      st.pop();
    } else {
      g[v][i]--;
      g[i][v]--;
      st.push(i);
    }
  }
  for (int i = 0; i <= 6; i++)
    for (int j = 0; j <= 6; j++)
      if (g[i][j] > 0) bad = true;
  if (bad) {
    cout << "No solution" << endl;
    return 0;
  }
  if (v1 != -1)
    for (int i = 0; i + 1 < (int)ans.size(); ++i)
      if (ans[i] == v1 && ans[i + 1] == v2 ||
          ans[i] == v2 && ans[i + 1] == v1) {
        vector<int> ans2;
        for (size_t j = i + 1; j < ans.size(); ++j) ans2.push_back(ans[j]);
        for (size_t j = 1; j <= i; ++j) ans2.push_back(ans[j]);
        ans = ans2;
        break;
      }
  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;
}
