Problem: You have a set of dominoes. Each domino is a rectangular tile with a line dividing its face into two square ends. Can you put all dominoes in a line one by one from left to right so that any two dominoes touched with the sides that had the same number of points? You can rotate the dominoes, changing the left and the right side (domino "1-4" turns into "4-1").

Input

The first line contains number n (1 ≤ n ≤ 100). Next n lines contains the dominoes. Each of these lines contains two numbers — the number of points (spots) on the left and the right half, correspondingly. The numbers of points (spots) are non-negative integers from 0 to 6.

Output

Print "No solution", if it is impossible to arrange the dominoes in the required manner. If the solution exists, then describe any way to arrange the dominoes. You put the dominoes from left to right. In each of n lines print the index of the domino to put in the corresponding position and then, after a space, character "+" (if you don't need to turn the domino) or "–" (if you need to turn it).

Examples

Input

5
1 2
2 4
2 4
6 4
2 1


Output

2 -
1 -
5 -
3 +
4 -

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.text.DecimalFormat;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.Comparator;
import java.util.Deque;
import java.util.HashMap;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.Map;
import java.util.PriorityQueue;
import java.util.Scanner;
import java.util.Stack;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;
import java.util.Queue;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
public class Main {
    class Node{
        int to; char c;
        Node(int to, char c){
            this.to = to;
            this.c = c;
        }
        Node(){}
    }
    Node[] edge = new Node[N<<1];
    int n;
    boolean[] flag = new boolean[N];
    ArrayList<Integer>[] G = new ArrayList[7];
    ArrayList<Node>ans = new ArrayList();
    void dfs(int u){
        for(int i = 0; i < G[u].size(); i++){
            int v = edge[G[u].get(i)].to, id = G[u].get(i)>>1;
            if(!flag[id]){
                flag[id] = true;
                dfs(v);
                ans.add(new Node(id, edge[G[u].get(i)].c));
            }
        }
    }
    void put(){
        for(int i = n-1; i >= 0; i--)out.println((ans.get(i).to+1)+" "+(char)(ans.get(i).c));
    }
    void work() throws Exception{
        for(int i = 0; i <= 6; i++) G[i] = new ArrayList();
        n = Int();
        
        for(int i = 0, u, v; i < n; i++){
            flag[i] = false;
            u = Int(); v = Int();
            edge[i*2] = new Node(v, '+');
            G[u].add(2*i);
            edge[i*2+1] = new Node(u, '-');
            G[v].add(i*2+1);
        }
        int u = edge[0].to, sum = 0;
        for(int i = 0; i <= 6; i++)
            if(G[i].size()%2 > 0){u = i; sum++;}
            if(sum == 0 || sum == 2){
                dfs(u);
                if(ans.size() == n)put();
                else out.println("No solution");
            }
            else out.println("No solution");
    }
    
    public static void main(String[] args) throws Exception{
        Main wo = new Main();
        in = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);
  //    in = new BufferedReader(new InputStreamReader(new FileInputStream(new File("input.txt"))));
  //    out = new PrintWriter(new File("output.txt"));
        wo.work();
        out.close();
    }
    static int N = 105; 
    static int M = 1011;  
    DecimalFormat df=new DecimalFormat("0.0000");
    static int inf = (int)1e9;
    static long inf64 = (long) 1e18;
    static double eps = 1e-8;
    static double Pi = Math.PI;
    static int mod = (int)1e9 + 7 ;
    
    private String Next() throws Exception{
        while (str == null || !str.hasMoreElements())
            str = new StringTokenizer(in.readLine());
        return str.nextToken();
    }
    private int Int() throws Exception{
        return Integer.parseInt(Next());
    }
    private long Long() throws Exception{
        return Long.parseLong(Next());
    }
    private double Double() throws Exception{
        return Double.parseDouble(Next());
    }
    StringTokenizer str;
    static Scanner cin = new Scanner(System.in);
    static BufferedReader in;
    static PrintWriter out;
  /*  
    class Edge{
        int from, to, dis, nex;
        Edge(){}
        Edge(int from, int to, int dis, int nex){
            this.from = from;
            this.to = to;
            this.dis = dis;
            this.nex = nex;
        }
    }
    Edge[] edge = new Edge[M<<1];
    int[] head = new int[N];
    int edgenum;
    void init_edge(){for(int i = 0; i < N; i++)head[i] = -1; edgenum = 0;}
    void add(int u, int v, int dis){
        edge[edgenum] = new Edge(u, v, dis, head[u]);
        head[u] = edgenum++;
    }/**/
    int upper_bound(int[] A, int l, int r, int val) {// upper_bound(A+l,A+r,val)-A;
        int pos = r;
        r--;
        while (l <= r) {
            int mid = (l + r) >> 1;
            if (A[mid] <= val) {
                l = mid + 1;
            } else {
                pos = mid;
                r = mid - 1;
            }
        }
        return pos;
    }
    int lower_bound(int[] A, int l, int r, int val) {// upper_bound(A+l,A+r,val)-A;
        int pos = r;
        r--;
        while (l <= r) {
            int mid = (l + r) >> 1;
            if (A[mid] < val) {
                l = mid + 1;
            } else {
                pos = mid;
                r = mid - 1;
            }
        }
        return pos;
    }
    int Pow(int x, int y) {
        int ans = 1;
        while (y > 0) {
            if ((y & 1) > 0)
                ans *= x;
            y >>= 1;
            x = x * x;
        }
        return ans;
    }
    double Pow(double x, int y) {
        double ans = 1;
        while (y > 0) {
            if ((y & 1) > 0)
                ans *= x;
            y >>= 1;
            x = x * x;
        }
        return ans;
    }
    int Pow_Mod(int x, int y, int mod) {
        int ans = 1;
        while (y > 0) {
            if ((y & 1) > 0)
                ans *= x;
            ans %= mod;
            y >>= 1;
            x = x * x;
            x %= mod;
        }
        return ans;
    }
    long Pow(long x, long y) {
        long ans = 1;
        while (y > 0) {
            if ((y & 1) > 0)
                ans *= x;
            y >>= 1;
            x = x * x;
        }
        return ans;
    }
    long Pow_Mod(long x, long y, long mod) {
        long ans = 1;
        while (y > 0) {
            if ((y & 1) > 0)
                ans *= x;
            ans %= mod;
            y >>= 1;
            x = x * x;
            x %= mod;
        }
        return ans;
    }

    int gcd(int x, int y){
        if(x>y){int tmp = x; x = y; y = tmp;}
        while(x>0){
            y %= x;
            int tmp = x; x = y; y = tmp;
        }
        return y;
    }
    int max(int x, int y) {
        return x > y ? x : y;
    }

    int min(int x, int y) {
        return x < y ? x : y;
    }

    double max(double x, double y) {
        return x > y ? x : y;
    }

    double min(double x, double y) {
        return x < y ? x : y;
    }

    long max(long x, long y) {
        return x > y ? x : y;
    }

    long min(long x, long y) {
        return x < y ? x : y;
    }

    int abs(int x) {
        return x > 0 ? x : -x;
    }

    double abs(double x) {
        return x > 0 ? x : -x;
    }

    long abs(long x) {
        return x > 0 ? x : -x;
    }

    boolean zero(double x) {
        return abs(x) < eps;
    }
    double sin(double x){return Math.sin(x);}
    double cos(double x){return Math.cos(x);}
    double tan(double x){return Math.tan(x);}
    double sqrt(double x){return Math.sqrt(x);}
}