#include <bits/stdc++.h>

#define ll long long
#define sfi(arg) scanf("%d", &arg)
#define sfl(arg) scanf("%lld", &arg)
#define pf printf

using namespace std;

vector<vector<int>> field(9);
map<pair<vector<vector<int>>, pair<int, int>>, int> mp;
int best = 0;
string abc;

int fu( int cur, int x, int y ) {
    if( mp.count(make_pair(field, make_pair(x, y))) == 1 ) { // Если уже были в данной точке с аналогичным field
        best += mp[make_pair(field, make_pair(x, y))];
        return mp[make_pair(field, make_pair(x, y))];
    }

    if( cur == 48 && x == 1 && y == 7 ) {
        best++;
        return 1;
    }

    if( x == 1 && y == 7 )
        return 0;

    int total = 0;
    if( abc[cur] == '?') {
        if( field[x + 1][y] == 0 ) {
            field[x + 1][y] = 1;
            total += fu( cur + 1, x + 1, y );
            field[x + 1][y] = 0;
        }

        if( field[x - 1][y] == 0 ) {
            field[x - 1][y] = 1;
            total += fu( cur + 1, x - 1, y );
            field[x - 1][y] = 0;
        }

        if( field[x][y + 1] == 0 ) {
            field[x][y + 1] = 1;
            total += fu( cur + 1, x, y + 1 );
            field[x][y + 1] = 0;
        }

        if( field[x][y - 1] == 0 ) {
            field[x][y - 1] = 1;
            total += fu( cur + 1, x, y - 1 );
            field[x][y - 1] = 0;
        }
    } else if(abc[cur] == 'R') {
        if( field[x + 1][y] == 0 ) {
            field[x + 1][y] = 1;
            total += fu( cur + 1, x + 1, y);
            field[x + 1][y] = 0;
        }
    } else if(abc[cur] == 'L') {
        if( field[x - 1][y] == 0 ) {
            field[x - 1][y] = 1;
            total += fu( cur + 1, x - 1, y);
            field[x - 1][y] = 0;
        }
    } else if(abc[cur] == 'U') {
        if( field[x][y - 1] == 0 ) {
            field[x][y - 1] = 1;
            total += fu( cur + 1, x, y - 1);
            field[x][y - 1] = 0;
        }
    } else {
        if( field[x][y + 1] == 0 ) {
            field[x][y + 1] = 1;
            total += fu( cur + 1, x, y + 1);
            field[x][y + 1] = 0;
        }
    }

    mp[make_pair(field, make_pair(x, y))] = total; // Запоминаем ситуацию
}

int main() {
    for( int x = 0; x < 9; x++ ) {
        for( int y = 0; y < 9; y++ ) {
            field[x].push_back(0);
        }
    }

    for( int x = 0; x < 9; x++ ) { // Мнимые границы
        field[0][x] = 1;
        field[8][x] = 1;
        field[x][0] = 1;
        field[x][8] = 1;
    }

    field[1][1] = 1;

    cin >> abc;

    fu( 0, 1, 1 );
    pf("%d\n", best);
}