//#define NDEBUG

#pragma region cp_template

#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <utility>
#include <vector>

namespace n91 {

using i32 = std::int32_t;
using i64 = std::int64_t;
using u32 = std::uint32_t;
using u64 = std::uint64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

struct rep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { ++i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr rep(const usize f, const usize l) noexcept
      : f(std::min(f, l)), l(l) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
struct revrep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { --i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr revrep(const usize f, const usize l) noexcept
      : f(l - 1), l(std::min(f, l) - 1) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
template <class T> auto md_vec(const usize n, const T &value) {
  return std::vector<T>(n, value);
}
template <class... Args> auto md_vec(const usize n, Args... args) {
  return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
}
template <class T> constexpr T difference(const T &a, const T &b) noexcept {
  return a < b ? b - a : a - b;
}
template <class T> void chmin(T &a, const T &b) noexcept {
  if (b < a)
    a = b;
}
template <class T> void chmax(T &a, const T &b) noexcept {
  if (a < b)
    a = b;
}
template <class F> class rec_lambda {
  F f;

public:
  rec_lambda(F &&f) : f(std::move(f)) {}
  template <class... Args> auto operator()(Args &&... args) const {
    return f(*this, std::forward<Args>(args)...);
  }
};
template <class F> auto make_rec(F &&f) { return rec_lambda<F>(std::move(f)); }
template <class T> T scan() {
  T ret;
  std::cin >> ret;
  return ret;
}
constexpr char eoln = '\n';
template <class T> T ceildiv(const T &l, const T &r) {
  return l / r + (l % r != 0 ? 1 : 0);
}

} // namespace n91

#pragma endregion cp_template

#include <cstdint>
#include <iostream>

template <std::uint32_t mod> class modint {
  using i64 = std::int64_t;
  using u32 = std::uint32_t;
  using u64 = std::int64_t;

  static_assert(mod < (u32(1) << 31), "mod must be less than 2**31");

public:
  u32 v;

  constexpr modint(const i64 x = 0) noexcept
      : v(x < 0 ? mod - 1 - -(x + 1) % mod : x % mod) {}
  constexpr modint operator+(const modint rhs) const noexcept {
    return modint(*this) += rhs;
  }
  constexpr modint operator-(const modint rhs) const noexcept {
    return modint(*this) -= rhs;
  }
  constexpr modint operator*(const modint rhs) const noexcept {
    return modint(*this) *= rhs;
  }
  constexpr modint operator/(const modint rhs) const noexcept {
    return modint(*this) /= rhs;
  }
  constexpr modint &operator+=(const modint rhs) noexcept {
    v += rhs.v;
    if (v >= mod)
      v -= mod;
    return *this;
  }
  constexpr modint &operator-=(const modint rhs) noexcept {
    if (v < rhs.v)
      v += mod;
    v -= rhs.v;
    return *this;
  }
  constexpr modint &operator*=(const modint rhs) noexcept {
    v = u64(v) * rhs.v % mod;
    return *this;
  }
  constexpr modint &operator/=(const modint rhs) noexcept {
    *this *= rhs.pow(mod - 2);
  }
  constexpr modint pow(u32 exp) noexcept {
    modint self(*this), ret(1);
    while (exp != 0) {
      if (exp % 2 != 0)
        ret *= self;
      self *= self;
      exp /= 2;
    }
    return ret;
  }
};

template <std::uint32_t mod>
std::istream &operator>>(std::istream &is, modint<mod> &rhs) {
  std::int64_t v;
  is >> v;
  rhs = modint<mod>(v);
  return is;
}

template <std::uint32_t mod>
std::ostream &operator<<(std::ostream &os, const modint<mod> &rhs) {
  os << rhs.v;
  return os;
}

#include <array>

namespace n91 {

void main_() {
  /*
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  //*/
  using mint = modint<998244353>;

  const std::vector<usize> s = []() {
    const std::string s = scan<std::string>();
    std::vector<usize> ret;
    for (const usize i : rep(0, s.size())) {
      ret.push_back(s[i] == '1');
    }
    return ret;
  }();
  const usize n = s.size();

  auto able = md_vec(n + 1, n + 2, n + 2, u32(0));
  able[0][0][0] = 1;
  for (const usize i : rep(0, n + 1)) {
    for (const usize j : revrep(0, n + 1)) {
      for (const usize k : revrep(0, n + 1)) {
        const auto cu = able[i][j][k];
        if (i + 2 <= n) {
          able[i + 2][j + !s[i]][k + s[i]] |= cu;
          able[i + 2][j + !s[i + 1]][k + s[i + 1]] |= cu;
        }
        if (i + 1 <= n) {
          if (j + k >= 1) {
            able[i + 1][j][k] |= cu;
          }
          if (j >= 1) {
            able[i + 1][j - 1 + !s[i]][k + s[i]] |= cu;
          }
          if (k >= 1) {
            able[i + 1][j + !s[i]][k - 1 + s[i]] |= cu;
          }
        }
        if (k + j >= 2) {
          if (k >= 1) {
            able[i][j][k - 1] |= cu;
          }
          if (j >= 1) {
            able[i][j - 1][k] |= cu;
          }
        }
      }
    }
  }

  for (const usize i : rep(0, n)) {
    for (const usize j : rep(0, n + 2)) {
      able[i][j][n + 1] = 0;
      able[i][n + 1][j] = 0;
    }
  }

  for (const usize i : revrep(0, n)) {
    for (const usize j : rep(0, n + 1)) {
      for (const usize k : rep(0, n + 1)) {
        able[i][j][k] |= able[i + 1][j + !s[i]][k + s[i]];
      }
    }
  }

  mint ans = 0;

  auto dp = md_vec(n + 2, n + 2, mint(0));
  dp[0][0] = 1;

  for (const usize i : revrep(0, n)) {
    for (const usize j : rep(0, n + 1)) {
      for (const usize k : rep(0, n + 1)) {
        dp[j + s[i]][k + !s[i]] += dp[j][k];
      }
    }
    for (const usize j : rep(0, n + 1)) {
      for (const usize k : rep(0, n + 1)) {
        if (able[i + 1][j][k]) {
          ans += dp[j][k];
        }
      }
    }

    // auto nx = md_vec(n + 2, n + 2, mint(0));
  }

  ans += 1;

  std::cout << ans << eoln;
}

} // namespace n91

int main() {
  n91::main_();
  return 0;
}


Measured memory_bytes: 114052