import java.util.*;
import java.io.*;

public class C {

    
    static class Reader 
    { 
        final private int BUFFER_SIZE = 1 << 16; 
        private DataInputStream din; 
        private byte[] buffer; 
        private int bufferPointer, bytesRead; 
  
        public Reader() 
        { 
            din = new DataInputStream(System.in); 
            buffer = new byte[BUFFER_SIZE]; 
            bufferPointer = bytesRead = 0; 
        } 
  
        public Reader(String file_name) throws IOException 
        { 
            din = new DataInputStream(new FileInputStream(file_name)); 
            buffer = new byte[BUFFER_SIZE]; 
            bufferPointer = bytesRead = 0; 
        } 
  
        public String readLine() throws IOException 
        { 
            byte[] buf = new byte[64]; // line length 
            int cnt = 0, c; 
            while ((c = read()) != -1) 
            { 
                if (c == '\n') 
                    break; 
                buf[cnt++] = (byte) c; 
            } 
            return new String(buf, 0, cnt); 
        } 
  
        public int nextInt() throws IOException 
        { 
            int ret = 0; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
            do
            { 
                ret = ret * 10 + c - '0'; 
            }  while ((c = read()) >= '0' && c <= '9'); 
  
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        public long nextLong() throws IOException 
        { 
            long ret = 0; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
            do { 
                ret = ret * 10 + c - '0'; 
            } 
            while ((c = read()) >= '0' && c <= '9'); 
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        public double nextDouble() throws IOException 
        { 
            double ret = 0, div = 1; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
  
            do { 
                ret = ret * 10 + c - '0'; 
            } 
            while ((c = read()) >= '0' && c <= '9'); 
  
            if (c == '.') 
            { 
                while ((c = read()) >= '0' && c <= '9') 
                { 
                    ret += (c - '0') / (div *= 10); 
                } 
            } 
  
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        private void fillBuffer() throws IOException 
        { 
            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE); 
            if (bytesRead == -1) 
                buffer[0] = -1; 
        } 
  
        private byte read() throws IOException 
        { 
            if (bufferPointer == bytesRead) 
                fillBuffer(); 
            return buffer[bufferPointer++]; 
        } 
  
        public void close() throws IOException 
        { 
            if (din == null) 
                return; 
            din.close(); 
        } 
    } 

    static int N,K;
    static class Pair{
        int s,t;
        int ans = -1;
    }

    public static void main(String[] args) throws Exception{
        Reader in = new Reader();

        // int T = in.nextInt();
        N = in.nextInt();

        List<Integer>[] adj = new ArrayList[N];
        Pair[] edges = new Pair[N-1];
        
         for(int i = 0;i < N-1;i++)
         {
            int s = in.nextInt()-1;
            int t = in.nextInt()-1;
            if(adj[s] == null)
                adj[s] = new ArrayList<Integer>();
            if(adj[t] == null)
                adj[t] = new ArrayList<Integer>();    
            edges[i] = new Pair();
            edges[i].s = s;
            edges[i].t = t;
            adj[s].add(t);
            adj[t].add(s);
         }

         int count = 0;
         for(int i = 0;i < N-1;i++)
         {
             int s = edges[i].s;
             int t = edges[i].t;
             if((adj[s].size() == 1 && adj[s].get(0) == t) || (adj[t].size() == 1 && adj[t].get(0) == s))
            {
                edges[i].ans = count;
                count++;
            }
        
         }

         for(int i = 0;i  < N-1;i++)
         {
             if(edges[i].ans == -1)
            {
                System.out.println(count);
                count++;
                continue;
            }
            System.out.println(edges[i].ans);
         }
    
    }

    

    static long returnmax(long[] arr)
    {
        long max = Integer.MIN_VALUE;
        for(int i = 0;i < arr.length;i++)
        {
            max = Math.max(max,arr[i]);
        }
        return max;
    }
 
}

