#include<iostream>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<iomanip>

using namespace std;

struct matrix
{
    double a[2][2];
    matrix mul(matrix& m)
    {
        matrix res;
        for(int i = 0; i < 2; i++) for(int j = 0; j < 2; j++) res.a[i][j] = 0.0;
        for(int i = 0; i < 2; i++) for(int j = 0; j < 2; j++) for(int k = 0; k < 2; k++)
        {
            res.a[i][j] += a[i][k] * m.a[k][j];
        }
        return res;
    }
    void id()
    {
        a[0][0] = 1.0;
        a[0][1] = 0.0;
        a[1][0] = 0.0;
        a[1][1] = 1.0;
    }
};

int n, T[100005];
double P[100005];
char pos[100005];

matrix do_pow(double p, int t)
{
    vector<matrix> pows(30);
    pows[0].a[0][0] = 1.0 - p;
    pows[0].a[0][1] = p;
    pows[0].a[1][0] = p;
    pows[0].a[1][1] = 1.0 - p;
    matrix res;
    res.id();
    if(t & 1)
    {
        res = pows[0];
    }
    for(int i = 1; i < 30; i++)
    {
        pows[i] = pows[i-1].mul(pows[i-1]);
        if((t>>i)&1)
        {
            res = res.mul(pows[i]);
        }
    }
    return res;
}

double solve()
{
    cout << endl;
    double pl = 1.0, evl = 0.0, pr = 0.0, evr = 0.0;
    for(int i = n-1; i >= 0; i--)
    {
        matrix m = do_pow(P[i], T[i]);
        double pli = (pos[i] == 'L' ? m.a[0][0] : m.a[1][0]);
        double pri = (pos[i] == 'L' ? m.a[0][1] : m.a[1][1]);
        cout << pli << " " << pri << endl;
        double plnew = pri;
        double prnew = pli;
        //double evlnew = pr * 1.0 + evr;
        //double evrnew = pl * 1.0 + evl;
        double evlnew = pr * (1.0 + evr) + pl * evl;
        double evrnew = pl * (1.0 + evl) + pr * evr;
        pr = prnew;
        pl = plnew;
        evr = evrnew;
        evl = evlnew;
        cout << pl << " " << pr << " " << evl << " " << evr << endl;
    }
    return pl * evl + pr * evr;
}

int main()
{
    while(cin >> n)
    {
        for(int i = 0; i < n; i++) scanf(" %d %c %lf ", &T[i], &pos[i], &P[i]);
        cout << fixed << setprecision(15) << solve() << endl;
    }
}



2
5 L 0.5
1 R 0.4

1
2 L 0.2

4
3 L 0
4 R 0
5 L 1
6 R 1

1
3 L 1

2
1 L 0.4
2 R 0.4




0.4 0.6
0.6 0.4 0 1
0.5 0.5
0.5 0.5 1.4 0.6
1.000000000000000

0.680000000000000 0.320000000000000
0.320000000000000 0.680000000000000 0.000000000000000 1.000000000000000
0.680000000000000

0.000000000000000 1.000000000000000
1.000000000000000 0.000000000000000 0.000000000000000 1.000000000000000
0.000000000000000 1.000000000000000
1.000000000000000 0.000000000000000 1.000000000000000 1.000000000000000
0.000000000000000 1.000000000000000
1.000000000000000 0.000000000000000 1.000000000000000 2.000000000000000
1.000000000000000 0.000000000000000
0.000000000000000 1.000000000000000 2.000000000000000 2.000000000000000
2.000000000000000

0.000000000000000 1.000000000000000
1.000000000000000 0.000000000000000 0.000000000000000 1.000000000000000
0.000000000000000

0.480000000000000 0.520000000000000
0.520000000000000 0.480000000000000 0.000000000000000 1.000000000000000
0.600000000000000 0.400000000000000
0.400000000000000 0.600000000000000 1.480000000000000 0.520000000000000
0.904000000000000
unusual@unusual-Neo:~/Desktop/ACM$ g++ -Wall -Wextra -o E E.cpp && E < E.in

0.4 0.6
0.6 0.4 0 1
0.5 0.5
0.5 0.5 0.8 1
0.900000000000000

0.680000000000000 0.320000000000000
0.320000000000000 0.680000000000000 0.000000000000000 1.000000000000000
0.680000000000000

0.000000000000000 1.000000000000000
1.000000000000000 0.000000000000000 0.000000000000000 1.000000000000000
0.000000000000000 1.000000000000000
1.000000000000000 0.000000000000000 0.000000000000000 1.000000000000000
0.000000000000000 1.000000000000000
1.000000000000000 0.000000000000000 0.000000000000000 1.000000000000000
1.000000000000000 0.000000000000000
0.000000000000000 1.000000000000000 0.000000000000000 1.000000000000000
1.000000000000000

0.000000000000000 1.000000000000000
1.000000000000000 0.000000000000000 0.000000000000000 1.000000000000000
0.000000000000000

0.480000000000000 0.520000000000000
0.520000000000000 0.480000000000000 0.000000000000000 1.000000000000000
0.600000000000000 0.400000000000000
0.400000000000000 0.600000000000000 0.960000000000000 1.000000000000000
0.984000000000000