One day, Hongcow goes to the store and sees a brand new deck of *n* special cards. Each individual card is either red or blue. He decides he wants to buy them immediately. To do this, he needs to play a game with the owner of the store.

This game takes some number of turns to complete. On a turn, Hongcow may do one of two things: 
 -  Collect tokens. Hongcow collects 1 red token and 1 blue token by choosing this option (thus, 2 tokens in total per one operation). -  Buy a card. Hongcow chooses some card and spends tokens to purchase it as specified below. 
The *i*-th card requires *r*<sub class="lower-index">*i*</sub> red resources and *b*<sub class="lower-index">*i*</sub> blue resources. Suppose Hongcow currently has *A* red cards and *B* blue cards. Then, the *i*-th card will require Hongcow to spend *max*(*r*<sub class="lower-index">*i*</sub> - *A*, 0) red tokens, and *max*(*b*<sub class="lower-index">*i*</sub> - *B*, 0) blue tokens. Note, only tokens disappear, but the cards stay with Hongcow forever. Each card can be bought only once.

Given a description of the cards and their costs determine the minimum number of turns Hongcow needs to purchase all cards.
The first line of input will contain a single integer *n* (1 ≤ *n* ≤ 16).

The next *n* lines of input will contain three tokens *c*<sub class="lower-index">*i*</sub>, *r*<sub class="lower-index">*i*</sub> and *b*<sub class="lower-index">*i*</sub>. *c*<sub class="lower-index">*i*</sub> will be 'R' or 'B', denoting the color of the card as red or blue. *r*<sub class="lower-index">*i*</sub> will be an integer denoting the amount of red resources required to obtain the card, and *b*<sub class="lower-index">*i*</sub> will be an integer denoting the amount of blue resources required to obtain the card (0 ≤ *r*<sub class="lower-index">*i*</sub>, *b*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">7</sup>).
For the first sample, Hongcow's four moves are as follows: 
 1.  Collect tokens 1.  Buy card 1 1.  Buy card 2 1.  Buy card 3 
For the second sample, one optimal strategy is as follows: 
 1.  Collect tokens 1.  Collect tokens 1.  Buy card 2 1.  Collect tokens 1.  Buy card 3 1.  Buy card 1
n = int(input())
c = 0
sol = 0
arr = []
while c<n:
    arr.append(input())
    bi = arr[c].split(' ')[1]
    ci = arr[c].split(' ')[2]
    sol = sol+(int(bi)+int(ci))
    c = c+1
print(sol)
