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

struct pt{
  int x,y;
};
pt operator+(const pt &l, const pt &r){
  return pt{l.x+r.x,l.y+r.y};
}
pt operator-(const pt &l, const pt &r){
  return pt{l.x-r.x,l.y-r.y};
}
bool operator<(const pt &l, const pt &r){
  return tie(l.x,l.y)<tie(r.x,r.y);
}
bool operator==(const pt &l, const pt &r){
  return tie(l.x,l.y)==tie(r.x,r.y);
}
pt rotl(pt p){
  return pt{-p.y,p.x}; 
}
pt rotr(pt p){
  return pt{p.y,-p.x};
}
pt rot(pt p){
  return pt{-p.x,-p.y};
}

int main(){
  vector<pt> d{{0,1},{1,0},{0,-1},{-1,0}}; int i=0;
  string s; cin >> s; int n=s.size();
  vector<pt> v; v.reserve(n+1); pt sum{0,0}; v.push_back(sum);
  for(char c: s){
    switch(c){
      case 'F':
        sum=sum+d[i];
        break;
      case 'R':
        i++; if(i>3) i=0;
        break;
      case 'L':
        i--; if(i<0) i=3;
        break;
    }
    v.push_back(sum);
  }
  i=0; set<pt> positions;
  for(int j=0;j<n;j++){
    switch(s[j]){
      case 'F':
        positions.insert(v[j]+rotl(v[n]-v[j+1]));
        positions.insert(v[j]+rotr(v[n]-v[j+1]));
        break;
      case 'R':
        positions.insert(v[j]+rot(v[n]-v[j+1]));
        positions.insert(v[j]+d[i]+rotl(v[n]-v[j+1]));
        i++; if(i>3) i=0;
        break;
      case 'L':
        positions.insert(v[j]+rot(v[n]-v[j+1]));
        positions.insert(v[j]+d[i]+rotr(v[n]-v[j+1]));
        i--; if(i<0) i=3;
        break;
    }
  }
  cout << positions.size() << '\n';
  /*for(pt i: positions){*/
  /*  cout << i.x << ' ' << i.y << '\n';*/
  /*}*/
}