import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const S = readToken();
      const N = cast(int)(S.length);
      
      alias Pt = Tuple!(int, "x", int, "y");
      Pt[] ps;
      Pt p;
      ps ~= p;
      
      Pt[3] vs;
      vs[0] = Pt(+1, 0);
      vs[1] = Pt(0, +1);
      vs[2] = Pt(-1, -1);
      foreach (i; 0 .. N) {
        const e = S[i] - 'a';
        p.x += vs[e].x;
        p.y += vs[e].y;
        ps ~= p;
        foreach (f; 0 .. 3) {
          vs[f].x *= -1;
          vs[f].y *= -1;
        }
        swap(vs[(e + 1) % 3], vs[(e + 2) % 3]);
      }
      debug {
        writeln("ps = ", ps);
      }
      
      ps = ps.sort.uniq.array;
      writeln(ps.length);
    }
  } catch (EOFException e) {
  }
}