In what concerns the continuous evaluation solving exercises grade during the semester, you should submit until 23:59 of January 4th
(this exercise will still be available for submission after that deadline, but without couting towards your grade)
[to understand the context of this problem, you should read the class #12 exercise sheet]

[AED074] Highest Bidder

Your company runs an auction of rare Pókemon cards. The auction works as follows:

• At any time a buyer can make a purchase offer, specifying the price at which they want to buy a card.
• At any time, a seller can decide to sell his card, and will sell it to the highest bidder.

An example of an auction would be as follows:

• John bids 20€.
• Mary bids 35€.
• Rachel bids 15€.
• Someone decides to sell. Faced with the 3 bids on the table (John, Mary and Rachel), the card is sold to Mary for 35€, who gets the card and is therefore no longer interested in buying more cards.
• Sarah makes an offer of 42€.
• Someone decides to sell. Faced with the 3 offers on the table (John, Rachel and Sarah), the card is sold to Sarah for 42€.
• Someone decides to sell. Faced with the 2 bids on the table (John and Rachel), the card is sold to John for 20€.

The Problem

Given the events of an auction, your task is to find out the buyer for each of the sold cards.

Input

The first line contains N, the number of events. This is followed by N lines, each of which describes an event, containing "SALE" if someone has decided to sell a card, or "OFFER name_i price_i" if it's an offer to buy a card for price_i by person name_i (the name is a letter only string and the price is an integer).

Output

The output should be made up of as many lines as there are occurrences of the word SALE in the input. On each of these lines, which come in the order of the sales, should be the price and the name of the buyer of the respective sale, separated by a space.

It is guaranteed that when someone wants to sell there is always at least one offer and that there are no ties (there is always someone with a maximum price).

Constraints

The following limits are guaranteed in all the test cases that will be given to your program:

7
OFFER John 20
OFFER Mary 35
OFFER Rachel 15
SALE
OFFER Sarah 42
SALE
SALE

35 Mary
42 Sarah
20 John

Explanation of Example Input

The example input is explained in the problem statement.