The organizers of the Riverside Night Bazaar keep one ledger sheet that lists, for every item on sale, the price charged by each of three fixed booths — Booth A, Booth B and Booth C — along the lane. Not every booth stocks every item: when a booth does not carry an item, its column on the sheet holds -1 instead of a price. Before the public price board can be printed, the sheet needs to be flattened into one line per (item, booth) pair for every booth that actually stocks that item, skipping every -1 entry.

Produce the flattened ledger sorted by item id in increasing order; within the same item, list the booths in the fixed order A, then B, then C.

Input format

• Line 1: a single integer n — the number of items on the sheet.
• Next n lines: four space-separated integers id price_a price_b price_c — the item's unique id and the price charged at Booth A, Booth B and Booth C respectively, where a value of -1 means that booth does not stock the item.

Output format

Print one line per (item, booth) pair whose price is not -1, formatted as id booth price (booth is one of the single letters A, B, or C). Lines must be ordered by id ascending, and for equal id by booth in the order A, B, C. If no booth stocks any item, print nothing.

Constraints

• 1 <= n <= 500
• 1 <= id <= 10000, and all id values are distinct
• each of price_a, price_b, price_c is either -1 or an integer in [1, 1000000]

3
1 10 -1 15
2 -1 20 -1
3 5 5 5

1 A 10
1 C 15
2 B 20
3 A 5
3 B 5
3 C 5

2
50 -1 -1 7
10 3 -1 -1

10 A 3
50 C 7