/**
*  _           _                 __                            _   _ _   _                                 _                    _                  _
* | |         | |               / /                           | | (_) | (_)                               | |                  (_)                | |
* | |__   __ _| |_ ___   ___   / /__ ___  _ __ ___  _ __   ___| |_ _| |_ ___   _____ ______ _ __ _   _ ___| |_ ______ ___ _ __  _ _ __  _ __   ___| |_ ___
* | '_ \ / _` | __/ _ \ / _ \ / / __/ _ \| '_ ` _ \| '_ \ / _ \ __| | __| \ \ / / _ \______| '__| | | / __| __|______/ __| '_ \| | '_ \| '_ \ / _ \ __/ __|
* | | | | (_| | || (_) | (_) / / (_| (_) | | | | | | |_) |  __/ |_| | |_| |\ V /  __/      | |  | |_| \__ \ |_       \__ \ | | | | |_) | |_) |  __/ |_\__ \
* |_| |_|\__,_|\__\___/ \___/_/ \___\___/|_| |_| |_| .__/ \___|\__|_|\__|_| \_/ \___|      |_|   \__,_|___/\__|      |___/_| |_|_| .__/| .__/ \___|\__|___/
*                                                  | |                                                                           | |   | |
*                                                  |_|                                                                           |_|   |_|
*
* https://github.com/hatoo/competitive-rust-snippets
*/
#[allow(unused_imports)]
use std::cmp::{max, min, Ordering};
#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};
#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};
#[allow(unused_imports)]
use std::iter::FromIterator;
mod util {
    use std::fmt::Debug;
    use std::io::{stdin, stdout, BufWriter, StdoutLock};
    use std::str::FromStr;
    #[allow(dead_code)]
    pub fn line() -> String {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        line.trim().to_string()
    }
    #[allow(dead_code)]
    pub fn chars() -> Vec<char> {
        line().chars().collect()
    }
    #[allow(dead_code)]
    pub fn gets<T: FromStr>() -> Vec<T>
    where
        <T as FromStr>::Err: Debug,
    {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        line.split_whitespace()
            .map(|t| t.parse().unwrap())
            .collect()
    }
    #[allow(dead_code)]
    pub fn with_bufwriter<F: FnOnce(BufWriter<StdoutLock>) -> ()>(f: F) {
        let out = stdout();
        let writer = BufWriter::new(out.lock());
        f(writer)
    }
}
#[allow(unused_macros)]
macro_rules ! get { ( $ t : ty ) => { { let mut line : String = String :: new ( ) ; stdin ( ) . read_line ( & mut line ) . unwrap ( ) ; line . trim ( ) . parse ::<$ t > ( ) . unwrap ( ) } } ; ( $ ( $ t : ty ) ,* ) => { { let mut line : String = String :: new ( ) ; stdin ( ) . read_line ( & mut line ) . unwrap ( ) ; let mut iter = line . split_whitespace ( ) ; ( $ ( iter . next ( ) . unwrap ( ) . parse ::<$ t > ( ) . unwrap ( ) , ) * ) } } ; ( $ t : ty ; $ n : expr ) => { ( 0 ..$ n ) . map ( | _ | get ! ( $ t ) ) . collect ::< Vec < _ >> ( ) } ; ( $ ( $ t : ty ) ,*; $ n : expr ) => { ( 0 ..$ n ) . map ( | _ | get ! ( $ ( $ t ) ,* ) ) . collect ::< Vec < _ >> ( ) } ; ( $ t : ty ;; ) => { { let mut line : String = String :: new ( ) ; stdin ( ) . read_line ( & mut line ) . unwrap ( ) ; line . split_whitespace ( ) . map ( | t | t . parse ::<$ t > ( ) . unwrap ( ) ) . collect ::< Vec < _ >> ( ) } } ; ( $ t : ty ;; $ n : expr ) => { ( 0 ..$ n ) . map ( | _ | get ! ( $ t ;; ) ) . collect ::< Vec < _ >> ( ) } ; }
#[allow(unused_macros)]
macro_rules ! debug { ( $ ( $ a : expr ) ,* ) => { eprintln ! ( concat ! ( $ ( stringify ! ( $ a ) , " = {:?}, " ) ,* ) , $ ( $ a ) ,* ) ; } }
const BIG_STACK_SIZE: bool = true;
#[allow(dead_code)]
fn main() {
    use std::thread;
    if BIG_STACK_SIZE {
        thread::Builder::new()
            .stack_size(32 * 1024 * 1024)
            .name("solve".into())
            .spawn(solve)
            .unwrap()
            .join()
            .unwrap();
    } else {
        solve();
    }
}

#[allow(dead_code)]
pub const INF: u64 = 1 << 60;

fn solve() {
    let n = get!(usize);
    let ca = get!(String, usize; 2*n);

    let mut cost_b = vec![vec![0; n + 1]; n + 1];
    let mut cost_w = vec![vec![0; n + 1]; n + 1];

    let mut b = vec![0; n];
    let mut w = vec![0; n];

    for (i, (c, a)) in ca.into_iter().enumerate() {
        if c == "B" {
            b[a - 1] = i;
        } else {
            w[a - 1] = i;
        }
    }

    {
        for i in 0..n {
            let lb = b[i..].iter().filter(|&&x| x < b[i]).count();
            let mut ll = 0;
            let mut left = vec![false; n + 1];
            // let mut left = (0..n).filter(|&j| w[j] < b[i]).collect::<HashSet<_>>();
            //
            for j in 0..n {
                if w[j] < b[i] {
                    left[j] = true;
                    ll += 1;
                }
            }

            for j in 0..n + 1 {
                cost_b[i][j] = lb + ll;
                if left[j] {
                    ll -= 1;
                }
                // left.remove(&j);
            }
        }
    }

    {
        for i in 0..n {
            let lw = w[i..].iter().filter(|&&x| x < w[i]).count();
            let mut ll = 0;
            let mut left = vec![false; n + 1];
            // let mut left = (0..n).filter(|&j| b[j] < w[i]).collect::<HashSet<_>>();

            for j in 0..n {
                if b[j] < w[i] {
                    left[j] = true;
                    ll += 1;
                }
            }

            for j in 0..n + 1 {
                cost_w[j][i] = lw + ll;
                if left[j] {
                    ll -= 1;
                }
            }
        }
    }

    let mut dp = vec![vec![INF; n + 1]; n + 1];

    dp[0][0] = 0;
    for i in 0..n + 1 {
        for j in 0..n + 1 {
            if i > 0 {
                dp[i][j] = min(dp[i][j], dp[i - 1][j] + cost_b[i - 1][j] as u64);
            }
            if j > 0 {
                dp[i][j] = min(dp[i][j], dp[i][j - 1] + cost_w[i][j - 1] as u64);
            }
        }
    }

    println!("{}", dp[n][n]);
}


Measured memory_bytes: 131452