// #include <boost/functional/hash.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// using mlint = boost::multiprecision::cpp_int;

#include <cassert>
#include <deque>
#include <queue>
#include <stack>
#include <algorithm>
#include <iostream>
#include <set>
#include <map>
#include <list>
#include <cmath>
#include <complex>
#include <functional>
#include <random>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <iomanip>

using namespace std;
using i64 = int_fast64_t;
using db = long double;
using pii = pair<int, int>;
using pli = pair<int_fast64_t, int>;
using pdi = pair<db, int>;
using plpii = pair<int_fast64_t, pair<int, int>>;
template <class T> using mat = vector<vector<T>>;
template <class T> using minheap = priority_queue<T, vector<T>, greater<T>>;

#define each(i,v) for (auto i = begin(v); i != end(v); ++i)
#define reach(i,v) for (auto i = rbegin(v); i != rend(v); ++i)
#define urep(i,s,t) for (int i = (s); i <= (t); ++i)
#define drep(i,s,t) for (int i = (s); i >= (t); --i)
#define rep(i,n) urep(i, 0, (n)-1)
#define rep1(i,n) urep(i, 1, (n))
#define rrep(i,n) drep(i, (n)-1, 0)
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define fir first
#define sec second
#define vct vector
#define u_map unordered_map
#define u_set unordered_set
#define l_bnd lower_bound
#define u_bnd upper_bound
#define rsz resize
#define ers erase
#define emp emplace
#define emf emplace_front
#define emb emplace_back
#define pof pop_front
#define pob pop_back
#define mkp make_pair
#define mkt make_tuple
#define popcnt __builtin_popcount

struct setupper {
    setupper(uint_fast8_t prec)
    {
        cin.tie(0);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(prec);
#ifdef Local
        auto print_atexit = []() { cerr<<"Exec time : " << clock() / (double)CLOCKS_PER_SEC * 1000.0 << "ms\n"; };
        atexit(print_atexit);
#endif
    }
} setuppre_obj(10);

namespace std {
    template <class T> void hash_combine(size_t &seed, T const &key) {
        seed ^= hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2);
    }
    template <class T, class U> struct hash<pair<T,U>> {
        size_t operator()(pair<T,U> const &pr) const
        {
            size_t seed = 0;
            hash_combine(seed,pr.first);
            hash_combine(seed,pr.second);
            return seed;
        }
    };
    template <class Tup, size_t index = tuple_size<Tup>::value - 1> struct hashval_calc {
        static void apply(size_t& seed, Tup const& tup) {
            hashval_calc<Tup, index - 1>::apply(seed, tup);
            hash_combine(seed,get<index>(tup));
        }
    };
    template <class Tup> struct hashval_calc<Tup,0> {
        static void apply(size_t& seed, Tup const& tup) {
            hash_combine(seed,get<0>(tup));
        }
    };
    template <class ...T> struct hash<tuple<T...>> {
        size_t operator()(tuple<T...> const& tup) const
        {
            size_t seed = 0;
            hashval_calc<tuple<T...>>::apply(seed,tup);
            return seed;
        }
    };
}

template <class T, class U> ostream& operator << (ostream& s, pair<T,U> p) { return s << p.fir << " " << p.sec; }
template <class T> ostream& operator << (ostream& s, vct<T> v) { each(i,v) { if(i != begin(v)) s << " "; s << *i; } return s; }
#define dump(...) cerr << " [ " << __LINE__ << " : " << __FUNCTION__ << " ] " << #__VA_ARGS__ << " : ";\
dump_func(__VA_ARGS__)
template <class T> void dump_func(T x) { cerr << x << '\n'; }
template <class T,class ...Rest> void dump_func(T x, Rest ... rest) { cerr << x << ","; dump_func(rest...); }
void read() {}
template <class T, class ...Rest> void read(T &x, Rest &... rest) { cin >> x; read(rest...); }
template <class T> void write(T x) { cout << x; }
template <class T, class ...Rest> void write(T x, Rest ... rest) { cout << x << ' '; write(rest...); }
void writeln() {}
template <class T, class ...Rest> void writeln(T x, Rest ... rest) { cout << x << '\n'; writeln(rest...); }
#define esc(...) writeln(__VA_ARGS__), exit(0)
const auto add = [](auto &x, auto y) { x += y; };
const auto mul = [](auto &x, auto y) { x *= y; };
const auto lam_min = [](auto x, auto y) { return min(x, y); };
const auto lam_max = [](auto x, auto y) { return max(x, y); };
const auto chmax = [](auto &m, auto x) { if(m < x){ m = x; return true; } return false; };
const auto chmin = [](auto &m, auto x) { if(m > x){ m = x; return true; } return false; };
bool bit(i64 n, uint8_t e) { return (n >> e) & 1; }
i64 mask(i64 n, uint8_t e) { return n & ((1 << e) - 1); }
int ilog(i64 x, uint64_t b = 2) {
    if (x) return ilog(x / b, b) + 1;
    return -1;
}
i64 qceil(i64 x, i64 y) { return x > 0 ? (x - 1) / y + 1 : x / y; }
template <class F> i64 binsr(i64 ok, i64 ng, const F &fn) {
    while (abs(ok - ng) > 1) {
        i64 mid = (ok + ng) / 2;
        (fn(mid) ? ok : ng) = mid;
    }
    return ok;
}
template <class A, size_t N, class T> void init(A (&array)[N], const T &val) { fill((T*)array,(T*)(array + N),val); }
template <class T> T cmprs(T &v) {
    T tmp = v, ret = v;
    sort(all(tmp));
    tmp.erase(unique(all(tmp)), end(tmp));
    each(i,ret) *i = l_bnd(all(tmp),*i) - begin(tmp);
    return ret;
}

template <class T> constexpr T inf = numeric_limits<T>::max() / 2 - 1;
constexpr int dx[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
constexpr int dy[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
constexpr long double gold = 1.618033988;
constexpr long double eps = 1e-15;
constexpr uint_fast64_t mod = 1e9 + 7;

int n;
int a[1<<12];
char c[1<<12];

int main() {
    read(n);
    rep(i,2*n) read(c[i],a[i]);
    int wcnt[1<<11]={},bcnt[1<<11]={};
    int calc_b[1<<11][1<<11],calc_w[1<<11][1<<11];
    rrep(i,n*2) {
        if(c[i]=='B') {
            rep(j,n+1) {
                calc_b[a[i]][j]=bcnt[a[i]]+wcnt[j];
            }
            urep(j,a[i],n) bcnt[j]++;
        } else {
            rep(j,n+1) {
                calc_w[a[i]][j]=wcnt[a[i]]+bcnt[j];
            }
            urep(j,a[i],n) wcnt[j]++;
        }
    }
    int dp[1<<11][1<<11];
    init(dp,inf<int>);
    dp[0][0]=0;
    rep(i,n+1)rep(j,n+1) {
        if(i) {
            chmin(dp[i][j],dp[i-1][j]+calc_w[i][j]);
        }
        if(j) {
            chmin(dp[i][j],dp[i][j-1]+calc_b[j][i]);
        }
    }
    writeln(dp[n][n]);
}


Measured memory_bytes: 49408