Find Itinerary From Tickets

easy
Question Solve Solutions 
1. You are given number N and 2*N number of strings that represent a list of N tickets(source and destination).
2. You have to find the itinerary in order using the given list of tickets.

Assumption -> The input list of tickets is not cyclic and there is one ticket from every city except the final destination.

Input Format

A number N N number of lines, where each line contains 2 strings.

Output Format

Check the sample ouput and question video.

Constraints

1 <= N <= 100

Example

Input
4
Chennai Banglore 
Bombay Delhi 
Goa Chennai 
Delhi Goa
Output
Bombay -> Delhi -> Goa -> Chennai -> Banglore.
Previous
Number Of Employees Under Every Manager
Next
Check If An Array Can Be Divided Into Pairs Whose Sum Is Divisible By K

Related Questions

easy Double Pair Array easy Subdomain Visit Count easy Group Anagrams easy Isomorphic Strings easy Valid Anagram easy Longest Subarray With Sum Divisible By K easy The Skyline Problem easy Word Pattern easy Number Of Employees Under Every Manager easy Check If An Array Can Be Divided Into Pairs Whose Sum Is Divisible By K easy Largest Subarray With Zero Sum easy Count Distinct Elements In Every Window Of Size K easy Largest Subarray With Contiguous Elements medium Count Of All Subarrays With Zero Sum hard Smallest Substring Of A String Containing All Characters Of Another String medium Smallest Substring Of A String Containing All Unique Characters Of Itself