#include <bits/stdc++.h>
using namespace std;

using ll = long long;

const pair<int, int> pairs[4] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};

void run(string* moves, size_t i, size_t N, ll X, ll Y, set<pair<ll, ll>>* endings)
{
	int direction = 1;
	while(++i < N)
	{
		switch(moves->at(i))
		{
			case 'F':
				X += pairs[direction].first;
				Y += pairs[direction].second;
				break;
			case 'R':
				if(++direction == 5)
					direction = 1;
				break;
			case 'L':
				if(--direction == 0)
					direction = 4;
				break;
		}
	}
	endings->insert({X, Y});
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	string moves;
	getline(cin, moves);
	size_t N = moves.size();

	set<pair<ll, ll>> endings;
	int direction = 1;
	ll X = 0;
	ll Y = 0;

	
	for(size_t i = 0;i<N;i++)
	{
		char original = moves[i];
		pair<char, char> PossibleMoves;
		switch(original)
		{
			case 'F':
				PossibleMoves = {'L', 'R'};
				break;
			case 'L':
				PossibleMoves = {'F', 'R'};
				break;
			case 'R':
				PossibleMoves = {'L', 'F'};
				break;
		}
		moves[i] = PossibleMoves.first;
		run(&moves, i-1, N, X, Y, &endings);
		moves[i] = PossibleMoves.second;
		run(&moves, i-1, N, X, Y, &endings);
		moves[i] = original;
		switch(original)
		{
			case 'F':
				X += pairs[direction].first;
				Y += pairs[direction].second;
				break;
			case 'R':
				if(++direction == 5)
					direction = 1;
				break;
			case 'L':
				if(--direction == 0)
					direction = 4;
				break;
		}
	}

	cout << endings.size();

	return 0;
}