// https://atcoder.jp/contests/abc130/tasks/abc130_f
//
#![allow(unused_imports)]
use std::io::*;
use std::io::Write;
use std::fmt::*;
use std::str::*;
use std::cmp::*;
use std::collections::*;

// Input macros.
// Original by tanakh: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
#[allow(unused_macros)]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};

    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };

    ($iter:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };

    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };

    ($iter:expr, [ next / $t:tt ]) => {
        {
            let len = read_value!($iter, usize);
            (0..len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
        }
    };

    ($iter:expr, switch) => {
        {
            let ty = read_value!($iter, i32);
            if ty == 1 {
                vec![ty, read_value!($iter, i32), read_value!($iter, i32)]
            } else if ty == 2 {
                vec![ty, read_value!($iter, i32)]
            } else {
                vec![ty, read_value!($iter, i32)]
            }
        }
    };

    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };

    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };

    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused_macros)]
macro_rules! read_line {
    ($t:tt) => {
        {
            let mut s = String::new();
            std::io::stdin().read_line(&mut s).unwrap();
            s.trim_right().parse::<$t>().unwrap()
        }
    }
}

#[allow(unused_macros)]
macro_rules! dvec {
    ($t:expr ; $len:expr) => {
        vec![$t; $len]
    };

    ($t:expr ; $len:expr, $($rest:expr),*) => {
        vec![dvec!($t; $($rest),*); $len]
    };
}

#[allow(unused_macros)]
macro_rules! ifv {
    ($t:expr, $a:expr, $b: expr) => {
        if $t { $a } else { $b }
    }
}

#[allow(unused_macros)]
macro_rules! fill {
    ($t:expr, $v:expr) => {
        for i in 0..$t.len() {
            $t[i] = $v;
        }
    };
}

#[allow(unused_macros)]
macro_rules! join {
    ($t:expr, $glue:expr) => {
        $t.into_iter().map(|w| w.to_string()).collect::<Vec<_>>().join($glue)
    };
}

#[allow(unused_macros)]
macro_rules! debug {
    ($($a:expr),*) => {
        println!(concat!($(stringify!($a), " = {:?}, "),*), $($a),*);
    }
}

// ===

const INF: i64 = 1e9 as i64;
const INF_TIME: i64 = 1e9 as i64;

fn minmax(bucket: &Vec<(i64, i64)>, time: i64) -> i64 {
    let mut minx = INF;
    let mut maxx = -INF;
    for &(pos, dir) in bucket {
        let t = pos+dir*time;
        minx = min(minx, t);
        maxx = max(maxx, t);
    }
    maxx-minx
}

fn solve(bucket: &Vec<(i64, i64)>) -> Vec<i64> {
    let mut times = vec![0];

    let mut fr = 0;
    let mut lastz = -111;
    loop {
        let wfr = fr;
        let mut to = INF_TIME;
        let head_len = minmax(bucket, fr);
        let z = minmax(bucket, fr+1) - head_len;
        while to - fr > 1 {
            let med = (to + fr) / 2;
            let to_len = minmax(bucket, med);
            if head_len + (med - wfr) * z >= to_len {
                fr = med;
            } else {
                to = med;
            }
        }
        // debug!(z, head_len, minmax(bucket, wfr), minmax(bucket, fr), minmax(bucket, fr+1));

        times.push(fr);
        times.push(fr+1);
        if z == lastz {
            break;
        }
        lastz = z;
    }
    times
}

fn main() {
    input! {
        n: usize,
        points: [(i64, i64, chars); n]
    };
    let points = points.into_iter().map(|v| (v.0*2, v.1*2, v.2[0])).collect::<Vec<_>>();
    let lrbucket = points.iter().cloned().map(|v| (v.0, ifv!(v.2 == 'L', -1, ifv!(v.2 == 'R', 1, 0)))).collect::<Vec<_>>();
    let tbbucket = points.iter().cloned().map(|v| (v.1, ifv!(v.2 == 'D', -1, ifv!(v.2 == 'U', 1, 0)))).collect::<Vec<_>>();

    let mut pt = vec![];
    pt.append(&mut solve(&lrbucket));
    // debug!("==");
    pt.append(&mut solve(&tbbucket));
    // for t in 0..100 {
    //     pt.push(t);
    // }
    pt.sort();
    pt.dedup();

    // debug!(pt);

    let mut best = 1e18 as i64;
    for t in pt {
        let x = minmax(&lrbucket, t);
        let y = minmax(&tbbucket, t);
        best = min(best, x*y);
    }
    println!("{:.9}", (best as f64) / 4.0f64);
}


Measured memory_bytes: 16116