You are given n lowercase words. Find the longest string that is a prefix of every one of them.
Input format
Line 1: an integer n, the number of words.
Line 2: n space-separated lowercase words.
Output format
Print the longest common prefix on its own line. If there is no common prefix, print an empty line.
Constraints
- 1 <= n <= 200
- 1 <= length of each word <= 200
- Words consist of lowercase English letters.