#include <iostream>
#include <string>
#include <vector>

using namespace std;
typedef long long ll;
ll mod = 924844033,dp[3000010] = {};
vector<ll> v,u;
int main(){
    string s; cin >> s;
    int i,n = s.size();
    v.push_back(-1);
    for(i=0;i<n;i++){
        if(s[i]=='1') v.push_back(i);
    }
    v.push_back(n);
    for(i=0;i<(int)v.size() - 1;i++) u.push_back(v[i + 1] - v[i] - 1);
    if(u.size()==1){
        cout << u[0] + 1 << endl;
        return 0;
    }
    ll ans = (u[0] + 1LL)*(u.back() + 1LL)%mod;
    if(u.size()==2){
        cout << ans << endl;
        return 0;
    }
    u.erase(u.begin()); u.pop_back();
    vector<pair<int,int>> st;
    st.push_back({0,1000000000});
    dp[0] = 1;
    for(i=1;i<=u.size();i++){
        int mx = -1;
        while(st.back().second<u[i - 1]){
            int j = st.back().first;
            (dp[i] += (u[i - 1] - mx)*dp[j]%mod) %= mod;
            mx = st.back().second;
            st.pop_back();
        }
        int j = st.back().first;
        (dp[i] += (u[i - 1] - mx)*dp[j]%mod) %= mod;
        st.push_back({i,u[i - 1]});
    }
    /*for(i=0;i<u.size();i++) cout << u[i] << " ";
    cout << endl;
    for(i=0;i<=u.size();i++) cout << dp[i] << " ";
    cout << endl;*/
    ll ans2 = 0;
    for(i=0;i<=u.size();i++) (ans2 += dp[i]) %= mod;
    (ans *= ans2) %= mod;
    //(ans *= dp[u.size()]) %= mod;
    cout << ans << endl;
}