#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int N = 2e5 + 5, mod = 998244353, B = 450;
struct qry
{
	int m, n, c, a;
	qry(int m0 = 0, int n0 = 0, int c0 = 0, int a0 = 0)
	{
		m = m0;
		n = n0;
		c = c0;
		a = a0;
	}
};
qry Q[N * 3];
int cnt;
char s[N];
int a[N], fac[N], inv[N], pw[N], len[N], qwq[N], pre[N];
int f[N], g[N];
int qpow(int x, int y)
{
	int ans = 1;
	while(y)
	{
		if(y & 1)
			ans = (ll)ans * x % mod;
		x = (ll)x * x % mod;
		y >>= 1;
	}
	return ans;
}
void prep(int n)
{
	int i;
	fac[0] = 1;
	for(i = 1; i <= n; i++)
		fac[i] = (ll)fac[i - 1] * i % mod;
	inv[n] = qpow(fac[n], mod - 2);
	for(i = n; i >= 1; i--)
		inv[i - 1] = (ll)inv[i] * i % mod;
	pw[0] = 1;
	for(i = 1; i <= n; i++)
		pw[i] = 2ll * pw[i - 1] % mod;
}
int C(int x, int y)
{
	return (x < y || y < 0) ? 0 : ((ll)fac[x] * inv[y] % mod * inv[x - y] % mod);
}
int F(int m, int n)
{
	int i, j, ans = 0, tmp;
	for(i = m; i <= n; i++)
		for(j = 1; j <= n / i; j++)
		{
			tmp = (ll)C(n - (i - 1) * j, j) * pw[n - i * j] % mod;
			if(!(j & 1))
				tmp = mod - tmp;
			ans = (ans + tmp) % mod;
		}
	return ans;
}

int main()
{
	int n, i, j, ans = 0, g, tmp, d, q;
	scanf("%s", s + 1);
	n = strlen(s + 1);
	for(i = 1; i <= n; i++)
		a[i] = s[n + 1 - i] - '0';
	prep(n);
	Q[++cnt] = qry(1, n, 1);
	Q[++cnt] = qry(1, n - 1, mod - 1);
	qwq[n] = len[n] = 1;
	for(i = 1; i <= n; i++)
		pre[i] = (a[i] ? i : pre[i - 1]);
	if(pre[n - 1])
	{
		g = n - pre[n - 1] + 1;
		ans = (ans + (ll)g * pw[pre[n - 1] - 1]) % mod;
		d = n + 1;
		q = pre[n - 1] - 1;
		if(g < d)
			Q[++cnt] = qry(g + 1, d, 1);
		if(g < d - 1)
			Q[++cnt] = qry(g + 1, d - 1, mod - 2);
		if(g < q)
			Q[++cnt] = qry(g + 1, q, 1);
	}
	for(i = n - 1; i >= 1; i--)
	{
		if(i < n - 1 && a[i + 1] && pre[i])
		{
			// calc
			g = max(qwq[i + 1], i - pre[i] + 1) + 1;
			ans = (ans + (ll)g * pw[pre[i] - 1]) % mod;
			d = i + 1;
			q = pre[i] - 1;
			if(g < d)
				Q[++cnt] = qry(g + 1, d, 1);
			if(g < d - 1)
				Q[++cnt] = qry(g + 1, d - 1, mod - 2);
			if(g < q)
				Q[++cnt] = qry(g + 1, q, 1);
		}
		len[i] = (a[i] ? 0 : len[i + 1] + 1);
		qwq[i] = max(qwq[i + 1], len[i]);
	}
	// cerr << cnt << endl;
	++n;
	for(i = 1; i <= B; i++) // fixed i <= B, j > B
	{
		for(j = 1; j <= n; j++)
		{
			f[j] = 2ll * f[j - 1] % mod;
			if(j > i)
				f[j] = (f[j] + mod - f[j - i]) % mod;
			if(j >= (B + 1) * i)
			{
				tmp = (ll)pw[j - i * (B + 1)] * C(j - i - (i - 1) * B, B) % mod;
				if(B & 1)
					tmp = mod - tmp;
				f[j] = (f[j] + tmp) % mod;
			}
 		}
 		for(j = 1; j <= cnt; j++)
 			if(i >= Q[j].m)
 				Q[j].a = (Q[j].a + f[Q[j].n]) % mod;
	}
	for(i = 1; i <= B; i++) // fixed j <= B
	{
		for(j = 1; j <= n; j++)
		{
			if(j < i)
			{
				f[j] = 0;
				continue;
			}
			f[j] = ((ll)C(j, i) * pw[j - i] + f[j - i]) % mod;
		}
		if(!(i & 1))
			for(j = 1; j <= n; j++)
				f[j] = (mod - f[j]) % mod;
		for(j = 1; j <= cnt; j++)
			if((ll)i * Q[j].m <= Q[j].n)
				Q[j].a = (Q[j].a + f[Q[j].n - i * (Q[j].m - 1)]) % mod;
	}
	for(i = 1; i <= cnt; i++)
		ans = (ans + (ll)Q[i].a * Q[i].c) % mod;
	printf("%d\n", ans);
	return 0;
}