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

typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;

#define rrep(i, m, n) for(int (i)=(m); (i)<(n);  (i)++)
#define erep(i, n)    for(int (i)=1; (i)<=(n); (i)++)
#define  rep(i, n)    for(int (i)=0; (i)<(n);  (i)++)
#define rrev(i, m, n) for(int (i)=(n)-1; (i)>=(m); (i)--)
#define erev(i, n)    for(int (i)=(n); (i)>=1; (i)--)
#define  rev(i, n)    for(int (i)=(n)-1; (i)>=0; (i)--)
#define EACH(v)       (v).begin(), (v).end()
#define minup(m, x)   (m=min(m, x))
#define maxup(m, x)   (m=max(m, x))
#define mp            make_pair
#define pb            push_back

#define INF 1000000000
#define MOD 1000000009
#define EPS 1E-9

string S;
char c;
int res = 1;
int cnt;

int main()
{
  //  cin >> S;
  /*
  rep(i, S.size()){
    if(S[i] == 'L') res = 2*res;
    if(S[i] == 'R') res = 2*res+1;
  }
  */

  while(scanf("%c", &c) && c!='\n' && c!='\0'){
    if(c == 'L') res = 2*res;
    if(c == 'R') res = 2*res+1;
    cnt += 1;
  }

  cout << res << endl;

  return 0;
}