#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 998244353;
const ll MAX = 4000001;
const long double eps = 1E-14;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

mint pw(mint a, ll b) {
	if (b == 0) { return 1; }
	mint ret = pw(a, b >> 1);
	ret *= ret;
	if (b & 1) { ret *= a; }
	return ret;
}

typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;

typedef vector<mint> vmint;
typedef vector<vector<mint>> vvmint;
typedef vector<vector<vector<mint>>> vvvmint;

//////////////////////////////////////
string S;

vvll bin;

vvmint memo;

ll M;

map<pair<ll,ll>, mint> mp;

mint solve(ll i, ll j) {

	if (mp.count({ i,j })) { return mp[{i, j}]; }

	mint ans = 0;

	if (i <= M) { return memo[i][j]; }

	//cout << i << j << endl;

	if (!(j & 1)) {ans = solve(i - 1,j >> 1); }
	else {ans = solve(i - 1, j >> 1)*2; }

	repn(k, i) {
		ll x = j & ((1ull << k) - 1);

		for (ll l = i - 2 * k; l >= 0; l -= k) {
			x = x & ((j >> (i - l - k)) & ((1ull << k) - 1));
			ans += solve(l,j >> (i - l)) * solve(k,x);
		}
	}

	mp[{i, j}] = ans;

	return ans;
}

int main() {
	cin >> S;
	ll N = S.size();

	bin.assign(N+1, vll(N+1, 0));

	rep(i, N) {
		bin[i][i] = 0;
		for (ll j = i+1; j <= N; j++) {
			bin[i][j] = bin[i][j - 1] * 2 + S[j-1] - '0';
		}
	}

	//rep(i, N + 1)rep(j, N + 1) cout << i<<j<<bin[i][j] << endl;

	M = min(23,N);
	
	memo.resize(M + 1);
	
	memo[0].assign(1, 1);

	repn(i, M) {
		memo[i].assign((1 << i), 0);
		rep(j, 1ull << i) {
			if (!(j&1)) { memo[i][j] = memo[i - 1][j>>1]; }
			else { memo[i][j] = memo[i - 1][j >> 1] * 2; }

			repn(k, i) {
				ll x = j & ((1ull << k) - 1);

				for (ll l = i - 2 * k; l >= 0; l -= k) {
					x = x & ((j >> (i - l - k)) & ((1ull << k) - 1));
					memo[i][j] += memo[l][j >> (i - l)] * memo[k][x];
				}
			}

			//cout << i << " " << j << " " << memo[i][j] << endl;
		}
	}

	vmint dp(N + 1, 0);
	dp[0] = 1;
	repn(i, N) {
		if (S[i - 1] == '0') { dp[i] = dp[i - 1]; }
		else { dp[i] = dp[i - 1] * 2; }

		repn(k, i) {
			ll x = bin[i - k][i];
			
			for (ll l = i - 2 * k; l >= 0; l -= k) {
				x = x & bin[l][l + k];
				
				dp[i] += dp[l] * solve(k, x);
			}
		}

		//cout << i <<" "<< dp[i] << endl;
	}

	cout << dp[N] << endl;
	
}

Measured memory_bytes: 134900