Banking System with Payments and Account Merging

Problem: Build a Simplified Banking System

Create a lightweight banking system that handles requests in timestamp order, where timestamps never go backward. It must provide account creation, deposits, transfers, cashback-enabled payments, payment lookups, account consolidation, and spender rankings.

Read the requests from standard input, then write one result per request to standard output.

---

Input Format

The first input line gives an integer Q, representing the total number of operations.

Each of the following Q lines contains exactly one request:

CREATE timestamp accountId
DEPOSIT timestamp accountId amount
TRANSFER timestamp sourceAccountId targetAccountId amount
PAY timestamp accountId amount
GET_PAYMENT_STATUS timestamp accountId paymentId
MERGE timestamp accountId1 accountId2
TOP_SPENDERS timestamp n

• timestamp is an integer, and request timestamps are in non-decreasing order.
• accountId is a space-free string.
• amount is a non-negative integer. A TRANSFER or PAY can succeed only when its amount is positive.

---

Operations

1. CREATE timestamp accountId

Open an account whose initial balance is 0.

• Print true when no account with that id currently exists.
• Print false when an active account already uses that id.

---

2. DEPOSIT timestamp accountId amount

Add amount to the specified account.

• When the account exists and remains active, print its balance after the deposit.
• In every other case, print -1.

---

3. TRANSFER timestamp sourceAccountId targetAccountId amount

Move amount from sourceAccountId to targetAccountId.

A transfer is valid only when all of the following hold:

• both referenced accounts exist and are active;
• the source and destination are not the same account;
• the source balance is at least amount;
• amount > 0

When it succeeds:

• decrease the source balance by amount;
• increase the target balance by amount;
• increase the source account's cumulative outgoing amount by amount;
• print the source account's balance after the transfer.

If any condition fails, print -1.

---

4. PAY timestamp accountId amount

Charge amount from an account and create a payment identifier.

A payment may be completed only if:

• the account exists and is active;
• its balance is no less than amount;
• amount > 0

For a successful payment:

• deduct amount from the account balance;
• add amount to that account's cumulative outgoing amount;
• assign an id of the form payment1, payment2, and so on, increasing globally across successful payments;
• arrange cashback for timestamp + 86400000, equal to floor(amount * 2 / 100);
• print the generated payment id.

For an unsuccessful payment, print an empty string, meaning a blank line.

Before handling each request, process every scheduled cashback with a scheduled time no later than the current timestamp.

---

5. GET_PAYMENT_STATUS timestamp accountId paymentId

Retrieve the current state of a payment.

• Print an empty string if the account is missing or inactive.
• Print an empty string if the payment id is unknown.
• Print an empty string if that payment is not associated with the current account.
• Print IN_PROGRESS when its cashback has not yet been credited.
• Print CASHBACK_RECEIVED once its cashback has been credited.

When the account that originally made a payment has subsequently been merged into another account, that payment is associated with the resulting active account.

---

6. MERGE timestamp accountId1 accountId2

Combine accountId2 into accountId1.

The merge is allowed only when:

• both accounts exist and are active;
• the ids identify different accounts.

After a successful merge:

• add accountId2's balance to accountId1;
• add accountId2's cumulative outgoing amount to accountId1;
• ensure cashbacks still pending for accountId2 are eventually added to accountId1;
• treat prior payments made by accountId2 as payments belonging to accountId1;
• mark accountId2 inactive so it can no longer be used directly.

Print true if the merge completes; otherwise, print false.

---

7. TOP_SPENDERS timestamp n

List up to n active accounts with the greatest cumulative outgoing amount.

Apply these ordering rules:

1. Accounts with larger cumulative outgoing amounts rank earlier.
2. Equal outgoing amounts are resolved by lexicographically smaller accountId first.

Use this output layout:

accountId1(totalOutgoing1), accountId2(totalOutgoing2)

When fewer than n accounts are active, output every active account.

---

Constraints

1 <= Q <= 200000
1 <= len(accountId) <= 50
0 <= timestamp <= 10^18
0 <= amount <= 10^12
1 <= n <= 100000

---

Example

Input

10
CREATE 10 cedar
CREATE 11 maple
DEPOSIT 12 cedar 900
TRANSFER 13 cedar maple 250
PAY 14 maple 120
GET_PAYMENT_STATUS 15 maple payment1
MERGE 16 cedar maple
GET_PAYMENT_STATUS 17 cedar payment1
TOP_SPENDERS 18 2
DEPOSIT 86400014 cedar 0

Output

true
true
900
650
payment1
IN_PROGRESS
true
IN_PROGRESS
cedar(370)
782

The transfer contributes 250 to cedar's outgoing total, and the payment contributes 120 to maple's total; merging produces cedar's total of 370. The payment's cashback is 2, which is credited at timestamp 86400014, changing cedar's balance from 780 to 782 before the final deposit.

Example

Input:
6
CREATE 21 red
CREATE 22 blue
DEPOSIT 23 red 80
TRANSFER 24 red blue 20
TRANSFER 25 red green 5
TOP_SPENDERS 26 2

Output:
true
true
80
60
-1
red(20), blue(0)

The first transfer succeeds and records 20 as red's outgoing amount, while the second fails because green is not an active account.