using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using SB = System.Text.StringBuilder;
//using System.Threading.Tasks;
//using System.Text.RegularExpressions;
//using System.Globalization;
//using System.Diagnostics;
using static System.Console;
using System.Numerics;
using static System.Math;
using pair = Pair<int, int>;

class Program
{
    static void Main()
    {
        //SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().solve();
        Out.Flush();
    }
    readonly Scanner cin = new Scanner();
    readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
    readonly int mod = 1000000007;
    readonly int dom = 998244353;
    bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
    bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (b.CompareTo(a) < 0) { a = b; return true; } return false; }

    long[,,] data;
    void q(int i, int j, long v)
    {
        chmin(ref data[i, j, 0], v);
        chmax(ref data[i, j, 1], v);
    }
    const long inf = 1145141919;
    void solve()
    {
        int N = cin.nextint;
        data = new long[2, 3, 2];
        for (int i = 0; i < 2; i++)
        {
            for (int j = 0; j < 3; j++)
            {
                data[i, j, 0] = inf;
                data[i, j, 1] = -inf;
            }
        }

        for (int i = 0; i < N; i++)
        {
            var x = cin.nextlong;
            var y = cin.nextlong;
            var d = cin.next[0];

            if (d == 'R' || d == 'L')
            {
                q(1, 0, y);
                if (d == 'R') q(0, 1, x);
                else q(0, 2, x);
            }
            else
            {
                q(0, 0, x);
                if (d == 'U') q(1, 1, y);
                else q(1, 2, y);
            }
        }

        var candidate = new List<double>();
        candidate.Add(0);

        for (int i = 0; i < 2; i++)
        {
            for (int k = 0; k < 2; k++)
            {
                candidate.Add(data[i, 0, k] - data[i, 1, k]);
                candidate.Add(data[i, 2, k] - data[i, 0, k]);
                candidate.Add((double)(data[i, 2, k] - data[i, 1, k]) / 2);
            }
        }

        double ans = double.MaxValue;

        foreach (var time in candidate)
        {
            if (time < 0)
            {
                continue;
            }
            var Z = new double[2, 2];
            for (int i = 0; i < 2; i++)
            {
                Z[i, 0] = double.MaxValue;
                Z[i, 1] = double.MinValue;
            }
            for (int i = 0; i < 2; i++)
            {
                calc(i, 0, Z, 0);
                calc(i, 1, Z, time);
                calc(i, 2, Z, -time);
            }

            chmin(ref ans, (Z[0, 1] - Z[0, 0]) * (Z[1, 1] - Z[1, 0]));
            //WriteLine(time + " " + (Z[0, 1] - Z[0, 0]) * (Z[1, 1] - Z[1, 0]));
        }

        WriteLine(ans.ToString("F10"));
    }
    void calc(int i, int j, double[,] Z, double time)
    {
        chmin(ref Z[i, 0], data[i, j, 0] + time);
        chmax(ref Z[i, 1], data[i, j, 1] + time);
    }

}


static class Ex
{
    public static void join<T>(this IEnumerable<T> values, string sep = " ") => WriteLine(string.Join(sep, values));
    public static string concat<T>(this IEnumerable<T> values) => string.Concat(values);
    public static string reverse(this string s) { var t = s.ToCharArray(); Array.Reverse(t); return t.concat(); }

    public static int lower_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) < 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
    public static int upper_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) <= 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
}

class Pair<T, U> : IComparable<Pair<T, U>> where T : IComparable<T> where U : IComparable<U>
{
    public T f; public U s;
    public Pair(T f, U s) { this.f = f; this.s = s; }
    public int CompareTo(Pair<T, U> a) => f.CompareTo(a.f) != 0 ? f.CompareTo(a.f) : s.CompareTo(a.s);
    public override string ToString() => $"{f} {s}";
}

class Scanner
{
    string[] s; int i;
    readonly char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan => ReadLine().Split();
    public int[] scanint => Array.ConvertAll(scan, int.Parse);
    public long[] scanlong => Array.ConvertAll(scan, long.Parse);
    public double[] scandouble => Array.ConvertAll(scan, double.Parse);
    public string next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return next;
        }
    }
    public int nextint => int.Parse(next);
    public long nextlong => long.Parse(next);
    public double nextdouble => double.Parse(next);
}


Measured memory_bytes: 17356