import java.util.NoSuchElementException;
import java.util.Stack;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class StackBukvi {

    public static char Evaluation(String [] niza) {

        ArrayStack<String> charStack = new ArrayStack<String>(100);

        int count;
        int vkupno = 0;
        int equal = 0;
        for (int i = 0; i < niza.length; i++) {

            if (niza[i].equals("S")) {
                count = 0;
                for (int j = i+1; j < niza.length; j++) {

                    if (niza[j].equals("S")) {
                        break;
                    }

                    if (niza[j].equals("T")) {
                        charStack.push(niza[i]);
                        count++;
                    }
                }
                if (count != vkupno) {
                    vkupno = count;
                    equal++;
                }
            }
        }

        if (equal==1)
            return 1;
        return 0;
    }

    public static void main(String[] args) throws IOException {
        BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
        String [] niza = bf.readLine().split("");
        int rez = Evaluation(niza);
        System.out.println(rez);

    }

}


class ArrayStack<E> extends Stack<E> {

    // Stekot e pretstaven na sledniot nacin:
    //depth e dlabochinata na stekot, a
    // elems[0...depth-1] se negovite elementi.
    private E[] elems;
    private int depth;

    @SuppressWarnings("unchecked")
    public ArrayStack (int maxDepth) {
        // Konstrukcija na nov, prazen stek.
        elems = (E[]) new Object[maxDepth];
        depth = 0;
    }


    public boolean isEmpty () {
        // Vrakja true ako i samo ako stekot e prazen.
        return (depth == 0);
    }


    public E peek () {
        // Go vrakja elementot na vrvot od stekot.
        if (depth == 0)
            throw new NoSuchElementException();
        return elems[depth-1];
    }


    public void clear () {
        // Go prazni stekot.
        for (int i = 0; i < depth; i++)  elems[i] = null;
        depth = 0;
    }


    public E push (E x) {
        // Go dodava x na vrvot na stekot.
        elems[depth++] = x;
        return x;
    }


    public E pop () {
        // Go otstranuva i vrakja elementot shto e na vrvot na stekot.
        if (depth == 0)
            throw new NoSuchElementException();
        E topmost = elems[--depth];
        elems[depth] = null;
        return topmost;
    }
}