#include <bits/stdc++.h>
using namespace std;
int adj[7][7];
vector<int> ans;
vector<pair<int, int> > input;
vector<pair<int, int> > answer;
map<int, bool> visited;
vector<pair<int, char> > finalanswer;
void dfs(int curr) {
  for (int i = 0; i < 7; i++) {
    if (adj[i][curr]) {
      adj[i][curr]--;
      adj[curr][i]--;
      dfs(i);
    }
  }
  ans.push_back(curr);
}
int main() {
  int n, x, y;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> x >> y;
    input.push_back(make_pair(x, y));
    adj[x][y]++;
    adj[y][x]++;
  }
  int start = x, sum = 0;
  for (int i = 0; i < 7; i++) {
    sum = 0;
    for (int j = 0; j < 7; j++) {
      if (adj[i][j]) sum += adj[i][j];
    }
    if (sum & 1) {
      start = i;
      break;
    }
  }
  dfs(start);
  int prev = ans[0];
  for (int i = 1; i < ans.size(); i++) {
    answer.push_back(make_pair(prev, ans[i]));
    prev = ans[i];
  }
  for (int i = 0; i < answer.size(); i++) {
    for (int j = 0; j < input.size(); j++) {
      if (answer[i].first == input[j].first &&
          answer[i].second == input[j].second && !visited[j]) {
        visited[j] = true;
        finalanswer.push_back(make_pair(j + 1, '+'));
        break;
      } else if (answer[i].first == input[j].second &&
                 answer[i].second == input[j].first && !visited[j]) {
        visited[j] = true;
        finalanswer.push_back(make_pair(j + 1, '-'));
        break;
      }
    }
  }
  if (finalanswer.size() != n) {
    cout << "No solution\n";
    return 0;
  }
  for (int i = 0; i < finalanswer.size(); i++) {
    cout << finalanswer[i].first << " " << finalanswer[i].second << endl;
  }
}
