#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 924844033;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

template<int mod>
struct Mod_Int{
    int x;

    Mod_Int() : x(0) {}

    Mod_Int(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

    Mod_Int &operator += (const Mod_Int &p){
        if((x += p.x) >= mod) x -= mod;
        return *this;
    }

    Mod_Int &operator -= (const Mod_Int &p){
        if((x += mod - p.x) >= mod) x -= mod;
        return *this;
    }

    Mod_Int &operator *= (const Mod_Int &p){
        x = (int) (1LL * x * p.x % mod);
        return *this;
    }

    Mod_Int &operator /= (const Mod_Int &p){
        *this *= p.inverse();
        return *this;
    }

    Mod_Int &operator ++ () {return *this += Mod_Int(1);}

    Mod_Int operator ++ (int){
        Mod_Int tmp = *this;
        ++*this;
        return tmp;
    }

    Mod_Int &operator -- () {return *this -= Mod_Int(1);}

    Mod_Int operator -- (int){
        Mod_Int tmp = *this;
        --*this;
        return tmp;
    }

    Mod_Int operator - () const {return Mod_Int(-x);}

    Mod_Int operator + (const Mod_Int &p) const {return Mod_Int(*this) += p;}

    Mod_Int operator - (const Mod_Int &p) const {return Mod_Int(*this) -= p;}

    Mod_Int operator * (const Mod_Int &p) const {return Mod_Int(*this) *= p;}

    Mod_Int operator / (const Mod_Int &p) const {return Mod_Int(*this) /= p;}

    bool operator == (const Mod_Int &p) const {return x == p.x;}

    bool operator != (const Mod_Int &p) const {return x != p.x;}

    Mod_Int inverse() const{
        assert(*this != Mod_Int(0));
        return pow(mod-2);
    }

    Mod_Int pow(long long k) const{
        Mod_Int now = *this, ret = 1;
        for(; k > 0; k >>= 1, now *= now){
            if(k&1) ret *= now;
        }
        return ret;
    }

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

    friend istream &operator >> (istream &is, Mod_Int &p){
        long long a;
        is >> a;
        p = Mod_Int<mod>(a);
        return is;
    }
};

using mint = Mod_Int<MOD>;

int main(){
    string S; cin >> S;

    int N = sz(S);
    S += '1';

    vector<int> cnt, ids;

    int ptr = 0;
    while(ptr <= N){
        int j = 0;
        while(ptr+j <= N && S[ptr+j] == '0') j++;
        ptr += j;
        cnt.eb(j), ids.eb(ptr);
        ptr++;
    }

    int K = sz(ids);
    //rep(i, K) cout << cnt[i] << ' ' << ids[i] << '\n';

    if(K == 1){
        cout << N << '\n';
        return 0;
    }

    vector<vector<tuple<int, int, int>>> p(K-1);

    vector<int> v;
    vector<pii> tmp;

    rep3(i, K-2, 0){
        while(!empty(v) && cnt[v.back()] <= cnt[i]){
            int t = v.back();
            auto [r, c] = tmp.back();
            v.pop_back(), tmp.pop_back();
            p[t].eb(i, r, c);
        }

        if(!empty(v)){
            int t = v.back();
            auto [r, c] = tmp.back();
            p[t].eb(i, r, c);
            tmp.back().first = i;
            tmp.back().second = cnt[t]-cnt[i];
        }

        v.eb(i);
        tmp.eb(i, cnt[i]+1);
    }

    rep(i, sz(v)){
        int t = v[i];
        auto [r, c] = tmp[i];
        p[t].eb(0, r, c);
    }

    vector<mint> dp(K-1, 0);
    vector<mint> s(K, 0);
    dp[0] = cnt[0]+1;
    s[1] = dp[0];

    rep2(i, 1, K-2){
        int pre = -1;
    
        each(e, p[i]){
            auto [l, r, c] = e;
            dp[i] += (s[r]-s[l])*c;
        }

        s[i+1] = s[i]+dp[i];
    }

    //rep(i, K-1) cout << dp[i] << ' '; cout << '\n';

    cout << accumulate(all(dp), mint(0))*(cnt[K-1]+1) << '\n';
}