#include <bits/stdc++.h>
#include <random>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
//#define ll __int128
//#define int ll
//#define int ll
//#define char ll
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;

#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cerr << (#x) << " = " << (x) << endl;

#ifdef MAX_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif

const double PI = 2 * acos(0.0);
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());

const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";


template <class T0, class T1>
inline ostream & operator << (ostream &out, pair<T0, T1> &a) {
    return out << "{" << a.first << ", " << a.second << "}";
}

template <class T0, class T1>
inline istream & operator >> (istream &in, pair<T0, T1> &a) {
    return in >> a.first >> a.second;
}

template <class T0, class T1, class T2>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}

template <class T0, class T1, class T2, class T3>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2, T3> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ", " <<  get<3>(a) << "}";
}

template<class T>
inline ostream & operator << (ostream &out, vector<T> &a) {
    out << "[";
    fori (i, a.size())
        out << a[i] << vector<string>{", ", "]  "}[i + 1 == a.size()];
    return out;
}


void smain();



signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
#ifdef MAX_HOME
    freopen("input.txt", "r", stdin);
    clock_t start = clock();
#endif
    cout << setprecision(12) << fixed;
    smain();
#ifdef MAX_HOME
    cout << "\n\n\n\nTOTAL EXECUTION TIME: " << float( clock () - start ) /  CLOCKS_PER_SEC << endl;
#endif
    return 0;
}

const int M = 998244353;

int pw(int a, int n = M - 2) {
    int ret = 1;
    while (n) {
        if (n & 1)
            ret = (ll) ret * a % M;
        a = (ll) a * a % M;
        n >>= 1;
    }
    return ret;
}

map<string, int> dp2;

string sand(string s, string t) {
    int n = s.size();
    string ret(n, '0');
    fori (i, n) {
        ret[i] = s[i] == '1' && t[i] == '1' ? '1' : '0';
    }
    return ret;
}

int cnt_pw(int a) {
    return 1;
    int ret = 0;
    for (int i = 2; i <= a; ++i) {
        if (a % i == 0) {
            int old = a;
            while (a % i == 0) {
                a /= i;
            }
            if (a == 1)
                ret++;
            a = old;
        }
    }
    return ret;
}

void insum(int & a, int b) {
    a = (a + b) % M;
}

int dfs(string);

int dfs2(string s) {
//    watch(s);
    if (dp2.count(s))
        return dp2[s];
    int ret = 0;
    int n = s.size();
    for (int d = 1; d < n; ++d) {
        if (n % d)
            continue;

        int cnt = n / d;
        string cur(d, '1');
        for (int i = 0; i < n; i += d) {
            cur = sand(cur, s.substr(i, d));
        }
        int add = (ll) dfs(cur) * cnt_pw(cnt) % M;
        insum(ret, add);
    }
//    cerr << "dp2[" << s << "] = " << ret << endl;
    return dp2[s] = ret;
}

map<string, int> dp;

int dfs(string s) {
    if (s.empty())
        return 1;
    if (dp.count(s))
        return dp[s];
    int n = SZ(s);
    int ret = (ll) dfs(s.substr(0, n - 1)) * (2 - (s.back() == '0')) % M;
//    vi suf(n + 1, 0);
//    for (int i = n - 1; i >= 0; --i) {
//        suf[i] = suf[i + 1] + (s[i] == '1');
//    }
    for (int i = 0; i < n; ++i) {
        insum(ret, (ll) dfs(s.substr(0, i)) * dfs2(s.substr(i, n)) % M);
    }
//    cerr << "dp[" << s << "] = " << ret << endl;
    return dp[s] = ret;
}

void smain() {
    string s;
    cin >> s;

    cout << dfs(s);
}

Measured memory_bytes: 12800