A community seed vault runs periodic giveaway events throughout the year, and every packet handed to a member garden is recorded as one line in a distribution log. Each log line records which distribution event it belongs to, which seed variety was given out, the year of the event, how many packets were handed out in that single line, and a nominal catalogue price the vault keeps for its own bookkeeping. The vault's coordinators want a running total that ignores year and price entirely: for every variety code that shows up anywhere in the log, report how many packets of that variety have been given out in total across every log line, and list the varieties from the smallest code to the largest.

Input format

Line 1: one integer N — the number of distribution log lines. The next N lines each contain five integers: eventId varietyCode year packets labelPrice.

Output format

For every distinct varietyCode that appears in the log, print one line varietyCode totalPackets, where totalPackets is the sum of packets over every log line carrying that variety code. Print the lines in strictly increasing order of varietyCode.

Constraints

• 1 <= N <= 2*10^4
• 1 <= eventId <= 10^9 (not necessarily distinct, and not otherwise used)
• 1 <= varietyCode <= 10^6
• 1 <= year <= 3000 (not used in the output)
• 1 <= packets <= 10^6
• 0 <= labelPrice <= 10^6 (not used in the output)

3
1 100 2008 10 5000
2 100 2009 12 5000
3 200 2011 15 9000

100 22
200 15

1
5 300 2020 7 100

300 7