Doubly linked list is one of the fundamental data structures. A doubly linked list is a sequence of elements, each containing information about the previous and the next elements of the list. In this problem all lists have linear structure. I.e. each element except the first has exactly one previous element, each element except the last has exactly one next element. The list is not closed in a cycle. In this problem you are given n memory cells forming one or more doubly linked lists. Each cell contains information about element from some list. Memory cells are numbered from 1 to n . For each cell i you are given two values: l i — cell containing previous element for the element in the cell i ; r i — cell containing next element for the element in the cell i . If cell i contains information about the element which has no previous element then l i = 0 . Similarly, if cell i contains information about the element which has no next element then r i = 0 . For example, for the picture above the values of l and r are the following: l 1 = 4 , r 1 = 7 ; l 2 = 5 , r 2 = 0 ; l 3 = 0 , r 3 = 0 ; l 4 = 6 , r 4 = 1 ; l 5 = 0 , r 5 = 2 ; l 6 = 0 , r 6 = 4 ; l 7 = 1 , r 7 = 0 . Your task is to unite all given lists in a single list, joining them to each other in any order. In particular, if the input data already contains a single list, then there is no need to perform any actions. Print the resulting list in the form of values l i , r i . Any other action, other than joining the beginning of one list to the end of another, can not be performed. The first line contains a single integer n ( 1 ≤ n ≤ 100 ) — the number of memory cells where the doubly linked lists are located. Each of the following n lines contains two integers l i , r i ( 0 ≤ l i , r i ≤ n ) — the cells of the previous and the next element of list for cell i . Value l i = 0 if element in cell i has no previous element in its list. Value r i = 0 if element in cell i has no next element in its list. It is gu