#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 998244353;
using Mint = ModInt<MO>;


/*
  \sum[s \in {0,1}^L] (max length of contiguous 1's)
  
  max < k
    [x^L] (1 - x^k) / (1 - 2 x + x^(k+1))
    = [x^L] (1 - x^k) \sum[i>=0] (-1)^i (x^(k+1))^i / (1-2x)^(i+1)
*/


int L;
char S[200'010];

pair<int, int> where[200'010][2];
Mint dp[200'010][2];

/*
  10 11
  || /|
   5  6
  
  11 12
  |\ ||
  5  6
*/
pair<int, int> to(const pair<int, int> &p, int e) {
  if (!~p.first || p == make_pair(L - 1, 0) || p == make_pair(L, 1)) {
    return make_pair(-1, -1);
  }
  return make_pair(p.first + 1, (S[p.first] - '0') ? (p.second | e) : (p.second & e));
}

int main() {
  for (; ~scanf("%s", S); ) {
    L = strlen(S);
    reverse(S, S + L);
    
    Mint all = 0;
    for (int i = L; --i >= 0; ) (all *= 2) += (S[i] - '0');
    
    for (int i = 0; i <= L; ++i) for (int u = 0; u < 2; ++u) {
      where[i][u] = make_pair(i, u);
    }
    
    Mint ans = 0;
    for (int k = 1; k <= L; ++k) {
      // where: go 1^k
      for (int i = 0; i <= L; ++i) for (int u = 0; u < 2; ++u) if (!(i == L && u == 0)) {
        where[i][u] = to(where[i][u], 1);
        dp[i][u] = 0;
      }
      dp[L - 1][0] = 1;
      dp[L][0] = 1;
      dp[L][1] = 1;
      for (int i = L; --i >= 0; ) for (int u = 0; u < 2; ++u) if (!(i == L - 1 && u == 0)) {
        // 0, 1
        for (int e = 0; e < 2; ++e) {
          const auto p = to(make_pair(i, u), e);
          dp[i][u] += dp[p.first][p.second];
        }
        // 1^k $
        if (where[i][u] == make_pair(L - 1, 0) || where[i][u] == make_pair(L, 1)) {
          dp[i][u] -= 1;
        }
        // 1^k 0
        {
          const auto p = to(where[i][u], 0);
          if (~p.first) dp[i][u] -= dp[p.first][p.second];
        }
      }
// cerr<<"k = "<<k<<": "<<dp[0][0]<<endl;
// cerr<<"  where = ";for(int i=0;i<=L;++i)cerr<<"["<<where[i][0]<<","<<where[i][1]<<"] ";cerr<<endl;
// cerr<<"  dp = ";for(int i=0;i<=L;++i)cerr<<"["<<dp[i][0]<<","<<dp[i][1]<<"] ";cerr<<endl;
      ans += (all - dp[0][0]);
    }
    ans += all;
    printf("%u\n", ans.x);
  }
  return 0;
}