#include <bits/stdc++.h>
using namespace std;
const int maxn = 100 + 50;
int n;
struct Edge {
  int u, v;
  inline int to(int from) { return from == u ? v : u; }
};
Edge E[maxn];
vector<int> P[10];
vector<int> ans;
int direction[maxn] = {0};
int BlockLabel[maxn] = {0};
int BlockNum = 0;
int Pi[10] = {0};
void DFS(int u) {
  for (vector<int>::iterator it = P[u].begin(); it != P[u].end(); it++) {
    if (!BlockLabel[E[*it].to(u)]) {
      BlockLabel[E[*it].to(u)] = BlockLabel[u];
      DFS(E[*it].to(u));
    }
  }
}
void Euler(int u) {
  while (Pi[u] < P[u].size()) {
    int v = E[P[u][Pi[u]]].to(u);
    int id = P[u][Pi[u]++];
    if (direction[id]) {
      continue;
    }
    direction[id] = E[id].u == E[id].to(u) ? 2 : 1;
    Euler(v);
    ans.push_back(id);
  }
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> E[i].u >> E[i].v;
    P[E[i].u].push_back(i);
    P[E[i].v].push_back(i);
  }
  for (int i = 0; i <= 6; i++) {
    if (P[i].size() && !BlockLabel[i]) {
      BlockLabel[i] = ++BlockNum;
      DFS(i);
    }
  }
  if (BlockNum > 1) {
    cout << "No solution" << endl;
    return 0;
  }
  vector<int> Odd;
  for (int i = 0; i <= 6; i++) {
    if (P[i].size() & 1) {
      Odd.push_back(i);
    }
  }
  if (Odd.size() != 0 && Odd.size() != 2) {
    cout << "No solution" << endl;
  }
  if (Odd.size() == 0) {
    for (int i = 0; i <= 6; i++) {
      if (P[i].size()) {
        Euler(i);
        break;
      }
    }
  } else {
    Euler(Odd[0]);
  }
  for (vector<int>::iterator it = ans.begin(); it != ans.end(); it++) {
    if (direction[*it] == 1) {
      cout << *it << " "
           << "-" << endl;
    } else {
      cout << *it << " "
           << "+" << endl;
    }
  }
  return 0;
}
