#include <stdio.h>

#include <iostream>

#include <algorithm>

#include <string.h>

#include <vector>

#include <map>

using namespace std;

typedef long long ll;

typedef pair<int,int>pii;

pii make(int x,int y)

{

    return pii(x,y);

}

map<pii,int>dp[<<];

int n,r[],b[],c[];

void UMAX(int& x,int y){if(x<y) x=y;};

void UMIN(int& x,int y){if(x>y) x=y;};

int main()

{

    scanf("%d",&n);

    for(int i=;i<n;i++)

    {

        char ch[];

        scanf("%s %d%d",ch,&r[i],&b[i]);

        if(ch[]=='R') c[i] = ;

    }

    dp[][make(,)] = ;

    map<pii,int>::iterator it;

    for(int x=;x<(<<n);x++)

    {

        int re = ,bl = ;

        for(int j=;j<n;j++)if((x>>j)&) c[j]?++re:++bl;

        for(int j=;j<n;j++)

        {

            if(x&(<<j)) continue;

            for(it = dp[x].begin();it!=dp[x].end();it++)

            {

                int nxt = (<<j)|x;

                int cnt = ; //花费

                int rv = max(r[j]-re,),bv = max(b[j]-bl,);

                if(it->first.first<rv) UMAX(cnt,rv-it->first.first);

                if(it->first.second<bv) UMAX(cnt,bv-it->first.second);

                pii nxt_s = pii(it->first.first+cnt-rv,it->first.first+cnt-bv);

                if(dp[nxt].count(nxt_s)==)dp[nxt][nxt_s] = INT_MAX;

                UMIN(dp[nxt][nxt_s],cnt+it->second+);//1  为买操作

            }

        }

    }

    int ans = INT_MAX;

    for(it = dp[(<<n)-].begin();it!=dp[(<<n)-].end();it++)

    {

        UMIN(ans,it->second);

    }

    printf("%d\n",ans);

    return ;

}