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)); }


struct ModInt(int M_) {
  import std.conv : to;
  alias M = M_;
  int x;
  this(ModInt a) { x = a.x; }
  this(long a) { x = cast(int)(a % M); if (x < 0) x += M; }
  ref ModInt opAssign(long a) { return (this = ModInt(a)); }
  ref ModInt opOpAssign(string op)(ModInt a) {
    static if (op == "+") { x += a.x; if (x >= M) x -= M; }
    else static if (op == "-") { x -= a.x; if (x < 0) x += M; }
    else static if (op == "*") { x = cast(int)((cast(long)(x) * a.x) % M); }
    else static if (op == "/") { this *= a.inv(); }
    else static assert(false);
    return this;
  }
  ref ModInt opOpAssign(string op)(long a) {
    static if (op == "^^") {
      if (a < 0) return (this = inv()^^(-a));
      ModInt t2 = this, te = ModInt(1);
      for (long e = a; e > 0; e >>= 1) {
        if (e & 1) te *= t2;
        t2 *= t2;
      }
      x = cast(int)(te.x);
      return this;
    } else return mixin("this " ~ op ~ "= ModInt(a)");
  }
  ModInt inv() const {
    int a = x, b = M, y = 1, z = 0, t;
    for (; ; ) {
      t = a / b; a -= t * b;
      if (a == 0) {
        assert(b == 1 || b == -1);
        return ModInt(b * z);
      }
      y -= t * z;
      t = b / a; b -= t * a;
      if (b == 0) {
        assert(a == 1 || a == -1);
        return ModInt(a * y);
      }
      z -= t * y;
    }
  }
  ModInt opUnary(string op: "-")() const { return ModInt(-x); }
  ModInt opBinary(string op, T)(T a) const {
    return mixin("ModInt(this) " ~ op ~ "= a");
  }
  ModInt opBinaryRight(string op)(long a) const {
    return mixin("ModInt(a) " ~ op ~ "= this");
  }
  bool opCast(T: bool)() const { return (x != 0); }
  string toString() const { return x.to!string; }
}

enum MO = 998244353;
alias Mint = ModInt!MO;


long brute(const(string) S) {
  bool[string] vis;
  void dfs(string s) {
    if (s !in vis) {
      vis[s] = true;
      const len = cast(int)(s.length);
      if (len >= 2) {
        foreach (i; 2 .. len + 1) {
          dfs(s[2 .. i] ~ s[0] ~ s[i .. len]);
          dfs(s[2 .. i] ~ s[1] ~ s[i .. len]);
        }
      }
    }
  }
  dfs(S);
  return vis.length;
}


void main() {
  
  
  try {
    for (; ; ) {
      const S = readToken();
      const L = cast(int)(S.length);
      
      auto num0s = new int[L + 1];
      auto num1s = new int[L + 1];
      foreach (x; 0 .. L) {
        num0s[x + 1] = num0s[x] + ((S[x] == '0') ? 1 : 0);
        num1s[x + 1] = num1s[x] + ((S[x] == '1') ? 1 : 0);
      }
      
      // num ops, floating 0s, floating 1s
      auto can = new bool[][][](L + 1, L + 1, L + 1);
      can[0][0][0] = true;
      foreach (i; 0 .. L) {
        foreach (a; 0 .. L + 1) foreach (b; 0 .. L + 1) {
          if (can[i][a][b]) {
            const x = i + a + b;
            // x, x + 1
            if (x + 2 <= L) {
              ((S[x] == '0') ? can[i + 1][a + 1][b] : can[i + 1][a][b + 1]) = true;
              ((S[x + 1] == '0') ? can[i + 1][a + 1][b] : can[i + 1][a][b + 1]) = true;
            }
            // x, 0
            if (x + 1 <= L && a >= 1) {
              ((S[x] == '0') ? can[i + 1][a - 1 + 1][b] : can[i + 1][a - 1][b + 1]) = true;
              can[i + 1][a - 1 + 1][b] = true;
            }
            // x, 1
            if (x + 1 <= L && b >= 1) {
              ((S[x] == '0') ? can[i + 1][a + 1][b - 1] : can[i + 1][a][b - 1 + 1]) = true;
              can[i + 1][a][b - 1 + 1] = true;
            }
            // 0, 0
            if (a >= 2) {
              can[i + 1][a - 2 + 1][b] = true;
            }
            // 0, 1
            if (a >= 1 && b >= 1) {
              can[i + 1][a - 1 + 1][b - 1] = true;
              can[i + 1][a - 1][b - 1 + 1] = true;
            }
            // 1, 1
            if (b >= 2) {
              can[i + 1][a][b - 2 + 1] = true;
            }
          }
        }
      }
      debug {
        /*
        if (L <= 16) {
          foreach (i; 0 .. L + 1) {
            writeln("i = ", i);
            foreach (a; 0 .. L + 1) {
              foreach (b; 0 .. L + 1) {
                write(can[i][a][b] ? 1 : 0);
              }
              writeln;
            }
          }
        }
        //*/
      }
      foreach (i; 1 .. L + 1) {
        foreach (a; 0 .. L + 1) {
          foreach (b; 0 .. L + 1) {
            if (can[i][a][b]) {
              const x = i + a + b;
              if (x > i + 1) {
                if (S[x - 1] == '0') {
                  if (a >= 1) assert(can[i][a - 1][b]);
                } else {
                  if (b >= 1) assert(can[i][a][b - 1]);
                }
              }
            }
          }
        }
      }
      
      auto dp = new Mint[][][](L + 1, L + 1, L + 1);
      dp[L][0][0] = 1;
      foreach_reverse (x; 1 .. L + 1) {
        foreach (a; 0 .. L + 1) foreach (b; 0 .. L + 1) {
          if (dp[x][a][b]) {
            const len = (L - x) + a + b;
            if (len < L) {
              dp[x - 1][a][b] += dp[x][a][b];
              ((S[x - 1] == '0') ? dp[x][a][b + 1] : dp[x][a + 1][b]) += dp[x][a][b];
            }
          }
        }
      }
      
      Mint ans = 1;
      foreach_reverse (x; 1 .. L + 1) {
        foreach (a; 0 .. L + 1) foreach (b; 0 .. L + 1) {
          if (dp[x][a][b]) {
            const len = (L - x) + a + b;
            if (1 <= len && len <= L - 1) {
              const i = L - len;
              int aa = a, bb = b;
              if (x < i + 1) {
                // muda match
                aa += num0s[i + 1] - num0s[x];
                bb += num1s[i + 1] - num1s[x];
              }
              if (can[i][aa][bb]) {
                ans += dp[x][a][b];
              }
            }
          }
        }
      }
      writeln(ans);
      
      debug {
        if (L <= 16) {
          const brt = brute(S);
          writeln("brt = ", brt);
          assert(brt == ans.x);
        }
      }
    }
  } catch (EOFException e) {
  }
}
