#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
inline ll read() {
    ll x = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9') {
        if (ch == '-') f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') {
        x = (x << 1) + (x << 3) + (ch ^ 48);
        ch = getchar();
    } return x * f;
}
const int N = 3e5 + 10, mod = 998244353, lm = 200; const ll inf = 1e18; 
ll jc[N], jcn[N], pw[N];
ll qpow(ll x, ll y) {
	ll ans = 1;
	while (y) {
		if (y & 1) ans = (ans * x) % mod;
		x = (x * x) % mod; y >>= 1;
	} return ans;
} string s;
ll C(int n, int m) {
    if (n < 0 || m < 0 || m > n) return 0;
    return jc[n] * jcn[m] % mod * jcn[n-m] % mod;
}
namespace sub1{
	int n;
	ll solve(int nn) {
        n = nn;
		ll sum = 0; n--;
		for (int m = 1; m <= n; m++) {
			for (int j = 1; j * m <= n; j++) {
				sum = (sum + ((j & 1) ? 1 : -1) * (C(n-j*m,j) * (n-j*m-j < 0 ? 0 : pw[n-j*m-j]) + C(n-j*m,j-1) * (n-j*m-j+1 < 0 ? 0 : pw[n-j*m-j+1]))) % mod; 
			}
		}
		sum = (sum % mod + mod) % mod;
        return sum;
	}
}
namespace sub2 {
    int n; ll f[N], g[N]; int mx, las, t;
    ll calc(int n, int k) {
        // !!!! n = 0?????
        int st = max(mx, k);
        ll sum = st * qpow(2, n) % mod; //求>=k的方案
        if (sub2::n > 2e3) {
            for (int m = 1; m <= st; m++) {
                for (int j = 1; j <= n && j * m <= n; j++) {
                    sum = (sum - ((j & 1) ? 1 : -1) * C(n-j*m, j) * (n-j*m-j < 0 ? 0 : pw[n-j*m-j])) % mod;
                }
                for (int j = 0; j <= n && j * m <= n; j++) {
                    sum = (sum - ((j & 1) ? -1 : 1) * C(n-j*m-max(0,(m-k)), j) * (n-j*m-j-max(0,(m-k)) < 0 ? 0 : pw[n-j*m-j-max(0,(m-k))])) % mod;
                }
            } 
        }
        // ll sum = 0;
        for (int m = 1; m <= n + k; m++) {
            for (int j = 1; j <= n && j * m <= n; j++) {
                sum = (sum + ((j & 1) ? 1 : -1) * C(n-j*m, j) * (n-j*m-j < 0 ? 0 : pw[n-j*m-j])) % mod;
            }
            for (int j = 0; j <= n && j * m <= n; j++) {
                sum = (sum + ((j & 1) ? -1 : 1) * C(n-j*m-max(0,(m-k)), j) * (n-j*m-j-max(0,(m-k)) < 0 ? 0 : pw[n-j*m-j-max(0,(m-k))])) % mod;
            }
        } return sum;
    }
    void solve() {
        n = s.size(); ll sum = 0;
        for (int i = 0; i < n; i++) sum = (sum * 2 + s[i] - '0') % mod;
        sum += sub1::solve(n); sum %= mod;
        mx = 1, las = 1, t = 1; set<int> ss;
        for (int i = 1; i < n; i++) {
            if (s[i] == '1') {
                int k = (t == 1 ? las + 1 : 1);
                if (ss.insert(max(k, mx)).second) {
                    for (int j = 1; j <= 450; j++) {
                        f[1] = 1; g[1] = 1;
                        for (int i = 2; i <= n; i++) {
                            f[i] = (2 * f[i-1] + f[i-2] + C(n, i) + C(n-j,i)) % mod;
                        }
                        for (int i = 2; i <= n; i++) {
                            g[i] = (3 * g[i-1] + g[i-2] + C(n, i) + C(n-j,i)) % mod;
                        }
                    }
                }
                assert(ss.size() <= 30);
                sum = (sum + calc(n - i - 1, k)) % mod; 
            }
            // int k = t == 1 ? las + 1 : ;
            int nw = s[i] - '0'; nw ^= 1;
            if (nw == t) las++;
            else las = 1, t = nw;
            if (t == 1) mx = max(mx, las);
        }
        sum = (sum % mod + mod) % mod;
        cout << sum;
    }
}
int main() {
	// assert(__lg(0) == -1);
    cin >> s; bool fl = 1;
    for (int i = 0; i < s.size(); i++) {
        fl &= (!i || s[i] == '0');
    }
    jc[0] = jcn[0] = pw[0] = 1;
    for (int i = 1; i < N; i++) jc[i] = (jc[i-1] * i) % mod;
    for (int i = 1; i < N; i++) pw[i] = (pw[i-1] << 1) % mod;
    jcn[N-1] = qpow(jc[N-1], mod - 2);
    for (int i = N - 2; i >= 1; i--) {
        jcn[i] = (jcn[i+1] * (i + 1)) % mod;
    }
    sub2::solve();
    // if ((fl && s.size() > 7)) {
    // 	cout << sub1::solve(s.size()); return 0;
	// } else {
	// 	sub2::solve(); return 0;
	// }
    return 0;
}