There are n people living the tinselwood state where they concatena e their town name before their first name. wri an algorithm to find the name of the town the given n people where the name of e town is the common substring having the maximum length. input the first line of the input consists of an integer - size, representing the number of people in the state (n). the second line consists of n space-separated strings representing the first names of the people of tinselwood.print a string in lowercase alphabets epresenting the name of the town of the given people where the name of the towns the common substring having the maximuen length. constraints 0s sizes 105 0