You are given n lines of a simplified INI-style configuration file. Each line is exactly one of:
- a section header, written
[name] - a key/value assignment, written
key=value(the value may be empty, and never contains=or a newline) - a blank line, which is ignored
Any key/value assignment that appears before the first section header belongs to a virtual section named global. Section names and keys consist only of lowercase letters, digits, and underscores (so they never contain a .). If the same key is assigned more than once within the same section, the LAST assignment wins.
Produce the flattened output: for every distinct (section, key) pair that ends up with a value, print one line section.key=value. Sort these lines lexicographically (as plain strings) before printing.
Input format
Line 1: an integer n.
Lines 2..n+1: each a section header, a key/value assignment, or blank.
Output format
The sorted flattened lines, one per line. If there are no key/value assignments at all, print nothing.
Constraints
- 0 ≤ n ≤ 100
- section names and keys are 1 to 20 characters from
[a-z0-9_] - values are 0 to 30 characters, never containing
=or\n