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_i red resources and b_i 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_i - A, 0) red tokens, and max(b_i - 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_i, r_i and b_i. c_i will be 'R' or 'B', denoting the color of the card as red or blue. r_i will be an integer denoting the amount of red resources required to obtain the card, and b_i will be an integer denoting the amount of blue resources required to obtain the card (0 ≤ r_i, b_i ≤ 10⁷).

Output a single integer, denoting the minimum number of turns needed to acquire all the cards.