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


// Modular template copied from tourist

template <typename T>
T inverse(T a, T m) {
  T u = 0, v = 1;
  while (a != 0) {
    T t = m / a;
    m -= t * a; swap(a, m);
    u -= t * v; swap(u, v);
  }
  assert(m == 1);
  return u;
}

template <typename T>
class Modular {
 public:
  using Type = typename decay<decltype(T::value)>::type;

  constexpr Modular() : value() {}
  template <typename U>
  Modular(const U& x) {
    value = normalize(x);
  }

  template <typename U>
  static Type normalize(const U& x) {
    Type v;
    if (-mod() <= x && x < mod()) v = static_cast<Type>(x);
    else v = static_cast<Type>(x % mod());
    if (v < 0) v += mod();
    return v;
  }

  const Type& operator()() const { return value; }
  template <typename U>
  explicit operator U() const { return static_cast<U>(value); }
  constexpr static Type mod() { return T::value; }

  Modular& operator+=(const Modular& other) { if ((value += other.value) >= mod()) value -= mod(); return *this; }
  Modular& operator-=(const Modular& other) { if ((value -= other.value) < 0) value += mod(); return *this; }
  template <typename U> Modular& operator+=(const U& other) { return *this += Modular(other); }
  template <typename U> Modular& operator-=(const U& other) { return *this -= Modular(other); }
  Modular& operator++() { return *this += 1; }
  Modular& operator--() { return *this -= 1; }
  Modular operator++(int) { Modular result(*this); *this += 1; return result; }
  Modular operator--(int) { Modular result(*this); *this -= 1; return result; }
  Modular operator-() const { return Modular(-value); }

  template <typename U = T>
  typename enable_if<is_same<typename Modular<U>::Type, int>::value, Modular>::type& operator*=(const Modular& rhs) {
#ifdef _WIN32
    uint64_t x = static_cast<int64_t>(value) * static_cast<int64_t>(rhs.value);
    uint32_t xh = static_cast<uint32_t>(x >> 32), xl = static_cast<uint32_t>(x), d, m;
    asm(
      "divl %4; \n\t"
      : "=a" (d), "=d" (m)
      : "d" (xh), "a" (xl), "r" (mod())
    );
    value = m;
#else
    value = normalize(static_cast<int64_t>(value) * static_cast<int64_t>(rhs.value));
#endif
    return *this;
  }
  template <typename U = T>
  typename enable_if<is_same<typename Modular<U>::Type, int64_t>::value, Modular>::type& operator*=(const Modular& rhs) {
    int64_t q = static_cast<int64_t>(static_cast<long double>(value) * rhs.value / mod());
    value = normalize(value * rhs.value - q * mod());
    return *this;
  }
  template <typename U = T>
  typename enable_if<!is_integral<typename Modular<U>::Type>::value, Modular>::type& operator*=(const Modular& rhs) {
    value = normalize(value * rhs.value);
    return *this;
  }

  Modular& operator/=(const Modular& other) { return *this *= Modular(inverse(other.value, mod())); }

  template <typename U>
  friend const Modular<U>& abs(const Modular<U>& v) { return v; }

  template <typename U>
  friend bool operator==(const Modular<U>& lhs, const Modular<U>& rhs);

  template <typename U>
  friend bool operator<(const Modular<U>& lhs, const Modular<U>& rhs);

  template <typename U>
  friend std::istream& operator>>(std::istream& stream, Modular<U>& number);

 private:
  Type value;
};

template <typename T> bool operator==(const Modular<T>& lhs, const Modular<T>& rhs) { return lhs.value == rhs.value; }
template <typename T, typename U> bool operator==(const Modular<T>& lhs, U rhs) { return lhs == Modular<T>(rhs); }
template <typename T, typename U> bool operator==(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) == rhs; }

template <typename T> bool operator!=(const Modular<T>& lhs, const Modular<T>& rhs) { return !(lhs == rhs); }
template <typename T, typename U> bool operator!=(const Modular<T>& lhs, U rhs) { return !(lhs == rhs); }
template <typename T, typename U> bool operator!=(U lhs, const Modular<T>& rhs) { return !(lhs == rhs); }

template <typename T> bool operator<(const Modular<T>& lhs, const Modular<T>& rhs) { return lhs.value < rhs.value; }

template <typename T> Modular<T> operator+(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) += rhs; }
template <typename T, typename U> Modular<T> operator+(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) += rhs; }
template <typename T, typename U> Modular<T> operator+(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) += rhs; }

template <typename T> Modular<T> operator-(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) -= rhs; }
template <typename T, typename U> Modular<T> operator-(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) -= rhs; }
template <typename T, typename U> Modular<T> operator-(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) -= rhs; }

template <typename T> Modular<T> operator*(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) *= rhs; }
template <typename T, typename U> Modular<T> operator*(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) *= rhs; }
template <typename T, typename U> Modular<T> operator*(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) *= rhs; }

template <typename T> Modular<T> operator/(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) /= rhs; }
template <typename T, typename U> Modular<T> operator/(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) /= rhs; }
template <typename T, typename U> Modular<T> operator/(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) /= rhs; }

template<typename T, typename U>
Modular<T> power(const Modular<T>& a, const U& b) {
  assert(b >= 0);
  Modular<T> x = a, res = 1;
  U p = b;
  while (p > 0) {
    if (p & 1) res *= x;
    x *= x;
    p >>= 1;
  }
  return res;
}

template <typename T>
bool IsZero(const Modular<T>& number) {
  return number() == 0;
}

template <typename T>
string to_string(const Modular<T>& number) {
  return to_string(number());
}

template <typename T>
std::ostream& operator<<(std::ostream& stream, const Modular<T>& number) {
  return stream << number();
}

template <typename T>
std::istream& operator>>(std::istream& stream, Modular<T>& number) {
  typename common_type<typename Modular<T>::Type, int64_t>::type x;
  stream >> x;
  number.value = Modular<T>::normalize(x);
  return stream;
}

/*
using ModType = int;

struct VarMod { static ModType value; };
ModType VarMod::value;
ModType& md = VarMod::value;
using Mint = Modular<VarMod>;
*/

constexpr int md = 998244353;
using Mint = Modular<std::integral_constant<decay<decltype(md)>::type, md>>;

Mint dp[301][301][301];
int can[310][310][310];
int can2[310][310];

int main() {
  ios::sync_with_stdio(0); cin.tie(0);
  string s;
  cin >> s;
  int n = s.size();

  //dp[i][ones][zeros] = number of strings, using i from end
  dp[0][0][0] = 1;
  for (int i = 0; i <= n; i++) {
    for (int ones = 0; ones <= n; ones++) {
      for (int zeros = 0; zeros <= n; zeros++) {
	if (i) dp[i][ones][zeros] += dp[i-1][ones][zeros];
	if (!i || s[n-i] == '0') {
	  if (ones) dp[i][ones][zeros] += dp[i][ones-1][zeros];
	}
	if (!i || s[n-i] == '1') {
	  if (zeros) dp[i][ones][zeros] += dp[i][ones][zeros-1];
	}
      }
    }
  }


  can[0][0][0] = 1;
  for (int p = 0; p <= n; p++) {
    for (int ones = n; ones >= 0; ones--) {
      for (int zeros = n; zeros >= 0; zeros--) {
	if (!can[p][ones][zeros]) continue;
	//Take 0
	if (ones >= 2) can[p][ones-1][zeros] = 1;
	if (zeros >= 2) can[p][ones][zeros-1] = 1;
	if (ones && zeros) {
	  can[p][ones-1][zeros] = 1;
	  can[p][ones][zeros-1] = 1;
	}

	//Take 1
	if (ones && p < n) can[p+1][ones-1+(s[p]=='1')][zeros+(s[p]=='0')] = 1;
	if (zeros && p < n) can[p+1][ones+(s[p]=='1')][zeros-1+(s[p]=='0')] = 1;
	if ((ones || zeros) && p < n)
	  can[p+1][ones][zeros] = 1;

	//Take 2
	if (p+2 <= n) {
	  can[p+2][ones+(s[p]=='1')][zeros+(s[p]=='0')] = 1;
	  can[p+2][ones+(s[p+1]=='1')][zeros+(s[p+1]=='0')] = 1;
	}
	//cout << p << ' ' <<  ones << ' ' << zeros << endl;
      }
    }
  }
  vector<array<int,2>> acc(n+1);
  for (int i = 0; i < n; i++) {
    acc[i+1] = {acc[i][0]+(s[i] == '0'),
		acc[i][1]+(s[i] == '1')};
  }
  for (int p = 0; p <= n; p++) {
    for (int ones = 0; ones <= n; ones++) {
      for (int zeros = 0; zeros <= n; zeros++) {
	if (can[p][ones][zeros]) {
	  int step = p-ones-zeros;
	  int ones_ = acc[p][1]-ones;
	  can2[step][ones_] = max(can2[step][ones_], p+1);
	}
      }
    }
  }
  //p-(ones+zeros) = step;
  Mint ans = 0;
  for (int step = 0; step < n; step++) {
    for (int ones_ = 0; ones_ <= n; ones_++) {
      int p = can2[step][ones_]-1;
      if (p >= 0) {
	//cout << "OK" << endl;
	int ones = acc[p][1]-ones_;
	int zeros = p-step-ones;
	assert(ones >= 0 && ones <= n);
	assert(zeros >= 0 && zeros <= n);
	assert(can[p][ones][zeros]);
	//cout << step << ' ' << p << ' ' << ones << ' ' << zeros << ' ' << dp[n-p][ones][zeros] << endl;
	ans += dp[n-p][ones][zeros];
      }
    }
  }
  cout << ans << endl;
}


Measured memory_bytes: 138624