A regional distribution center stamps every incoming bin with a short alphabetic tag before it goes onto the loading manifest. A tag is considered "absorbed" whenever it appears as a contiguous run of characters inside some other bin's tag on the same manifest. Given the manifest, list every absorbed tag, in the order it appears on the manifest.

Input format

• Line 1: an integer n, the number of tags on the manifest.
• The next n lines each contain one tag: a nonempty string of lowercase English letters. All n tags are guaranteed to be pairwise distinct.

Output format

Print, one per line and in the same relative order as the manifest, every tag that occurs as a contiguous substring of at least one other tag on the manifest. If no tag qualifies, print nothing (an empty output, aside from an optional trailing newline, is acceptable).

Constraints

• 1 <= n <= 100
• 1 <= length of each tag <= 30
• Each tag consists only of lowercase English letters ('a'-'z').
• All n tags are distinct strings.

4
cargo
car
go
freight

car
go

3
alpha
beta
gamma

(empty)