#include <bits/stdc++.h>
using namespace std;
int N;
int paths[7][7];
int degree[7];
vector<int> circuit;
stack<int> current;
struct domino {
  int left;
  int right;
  bool used;
};
domino ds[100];
int main() {
  for (int i = 0; i <= 6; i++)
    for (int j = 0; j <= 6; j++) paths[i][j] = 0;
  for (int i = 0; i <= 6; i++) degree[i] = 0;
  cin >> N;
  for (int i = 0; i < N; i++) {
    cin >> ds[i].left >> ds[i].right;
    paths[ds[i].left][ds[i].right]++;
    paths[ds[i].right][ds[i].left]++;
    degree[ds[i].left]++;
    degree[ds[i].right]++;
    ds[i].used = false;
  }
  int odds = 0;
  int oddindex = -1;
  for (int i = 0; i <= 6; i++) {
    if (degree[i] % 2 != 0) {
      odds++;
      oddindex = i;
    }
  }
  if (odds > 2) {
    cout << "No solution\n";
    return 0;
  }
  if (oddindex == -1) {
    oddindex = 0;
    while (degree[oddindex] == 0) oddindex++;
  }
  current.push(oddindex);
  while (!current.empty()) {
    int node = current.top();
    if (degree[node] == 0) {
      circuit.push_back(node);
      current.pop();
    } else {
      int next = 0;
      while (paths[node][next] == 0) next++;
      paths[node][next]--;
      paths[next][node]--;
      degree[node]--;
      degree[next]--;
      current.push(next);
    }
  }
  int size = circuit.size();
  if (circuit.size() != N + 1) {
    cout << "No solution\n";
    return 0;
  }
  for (int i = 0; i < size - 1; i++) {
    int index = 0;
    while (!(
        ds[index].used == false &&
        (ds[index].left == circuit[i] && ds[index].right == circuit[i + 1] ||
         ds[index].right == circuit[i] && ds[index].left == circuit[i + 1]))) {
      index++;
      if (index >= N) {
        cout << "fail at " << i << endl;
        return 1;
      }
    }
    ds[index].used = true;
    cout << index + 1 << (ds[index].left == circuit[i] ? " +\n" : " -\n");
  }
}
